/
_0066_PlusOne.java
65 lines (61 loc) · 1.68 KB
/
_0066_PlusOne.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
package com.diguage.algorithm.leetcode;
import java.util.Arrays;
/**
* = 66. Plus One
*
* https://leetcode.com/problems/plus-one/description/[Plus One - LeetCode]
*
* Given a *non-empty* array of digits representing a non-negative integer,
* plus one to the integer.
*
* The digits are stored such that the most significant digit is at the
* head of the list, and each element in the array contain a single digit.
*
* You may assume the integer does not contain any leading zero, except
* the number 0 itself.
*
* .Example 1:
* [source]
* ----
* Input: [1,2,3]
* Output: [1,2,4]
* Explanation: The array represents the integer 123.
* ----
*
* .Example 2:
* [source]
* ----
* Input: [4,3,2,1]
* Output: [4,3,2,2]
* Explanation: The array represents the integer 4321.
* ----
*
* @author D瓜哥, https://www.diguage.com/
* @since 2018-07-14 15:30
*/
public class _0066_PlusOne {
public static int[] plusOne(int[] digits) {
if (digits == null || digits.length == 0) {
return digits;
}
for (int i = digits.length - 1; i >= 0; i--) {
if (digits[i] < 9) {
digits[i]++;
return digits;
} else {
digits[i] = 0;
}
}
int[] result = new int[digits.length + 1];
result[0] = 1;
return result;
}
public static void main(String[] args) {
int[] a1 = new int[]{4, 3, 2, 1};
int[] a2 = new int[]{9, 9, 9};
int[] a3 = new int[]{9, 9, 8};
System.out.println(Arrays.toString(plusOne(a1)));
System.out.println(Arrays.toString(plusOne(a2)));
System.out.println(Arrays.toString(plusOne(a3)));
}
}