Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
41 lines (33 loc) · 1011 Bytes

File metadata and controls

41 lines (33 loc) · 1011 Bytes
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
package Algorithms.array;
public class PlusOne {
public int[] plusOne(int[] digits) {
if (digits == null) {
return null;
}
int overFlow = 0;
int len = digits.length;
int[] ret = new int[len];
for (int i = len - 1; i >= 0; i--) {
int sum = digits[i] + overFlow;
if (i == len - 1) {
// 只有最后一位需要加1
sum++;
}
// 溢出的话,置溢出位。
if (sum > 9) {
overFlow = 1;
} else {
overFlow = 0;
}
// 把高位去掉,因为我们要0-9
ret[i] = sum % 10;
}
if (overFlow == 1) {
int[] retOver = new int[len + 1];
System.arraycopy(retOver, 1, ret, 0, len);
retOver[0] = 1;
return retOver;
}
return ret;
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.