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
23 lines (22 loc) · 487 Bytes

File metadata and controls

23 lines (22 loc) · 487 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
/**
* Given a number represented as an array of digits, plus one to the number.
*/
public class PlusOne {
public int[] plusOne(int[] digits) {
int length = digits.length;
int add = 1;
for (int i = length - 1; i >= 0; i--) {
int sum = digits[i] + add;
digits[i] = sum % 10;
add = sum / 10;
if (add == 0)
return digits;
}
int[] ret = new int[length + 1];
ret[0] = add;
for (int i = 0; i < length; i++) {
ret[i + 1] = digits[i];
}
return ret;
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.