leetcode链接：
https://leetcode.cn/problems/plus-one/
方案一
结果：可正常运行
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
| int[] result = new int[digits.length];
int flage = 1;
for (int i = digits.length -1 ; i > -1; i--) {
if (flage == 1){
if (digits[i] + 1 != 10) {
result[i] = digits[i] + 1;
flage = 0;
} else {
result[i] = 0;
if (i == 0) {
int[] result1 = new int[digits.length + 1];
result1[0] = 1;
for (int j = 1; j < result1.length; j++) {
result1[j] = 0;
}
return result1;
}
}
} else {
result[i] = digits[i];
}
}
|
几乎最优方案
根据题解知
https://leetcode.cn/problems/plus-one/solution/java-shu-xue-jie-ti-by-yhhzw/
1
2
3
4
5
6
7
8
9
10
11
12
| for (int i = digits.length - 1; i > -1; i--) {
if (digits[i] == 9) {
digits[i] = 0;
} else {
digits[i]++;
return digits;
}
}
digits = new int[digits.length + 1];
digits[0] = 1;
return digits;
|