-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathplus-one.java
More file actions
47 lines (37 loc) · 1.29 KB
/
Copy pathplus-one.java
File metadata and controls
47 lines (37 loc) · 1.29 KB
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
class Solution {
public int[] plusOne(int[] digits) {
ArrayList<Integer> list = new ArrayList<>();
int last;
sum(list, digits, 0);
int size = list.size();
if (size >= digits.length) {
int [] array = new int[size];
for (int i = 0; i < size; i++) {
array[size - i - 1] = list.get(i);
}
return array;
} else {
int [] array = new int[digits.length];
for (int i = 0; i < size; i++) {
array[digits.length - i - 1] = list.get(i);
}
for (int i = size; i < digits.length; i++) {
array[digits.length - i - 1] = digits[digits.length - i - 1];
}
return array;
}
}
public void sum(ArrayList<Integer> list, int[] digits, int k) {
if (k == digits.length) {
list.add(1);
} else {
digits[digits.length - k - 1]++;
if (digits[digits.length - k - 1] == 10) {
list.add(0);
sum(list, digits, k+1);
} else {
list.add(digits[digits.length - k - 1]);
}
}
}
}