-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathSolution.java
executable file
·46 lines (41 loc) · 1.03 KB
/
Solution.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
package $066;
/**
* @author Junlan Shuai[[email protected]].
* @date Created on 12:36 2018/5/19.
*/
/**
* wrong answer
*/
public class Solution {
public int[] plusOne(int[] digits) {
if (digits == null || digits.length == 0){
return digits;
}
int len = digits.length - 1;
int sum = digits[len] + 1;
int[] re;
if (sum > 9){
while (sum > 9 && len > 0){
digits[len] = sum % 10;
sum = sum / 10;
sum = sum + digits[--len];
}
}else {
digits[len] = sum;
}
if (sum > 9){
re = new int[digits.length + 1];
re[0] = 1;
}else {
digits[len] = sum;
re = digits;
}
return re;
}
public static void main(String[] args) {
Solution solution = new Solution();
int[] a = {6,1,4,5,3,9,0,1,9,5,1,8,6,7,0,5,5,4,3};
solution.plusOne(a);
System.out.println(Long.MAX_VALUE);
}
}