-
Notifications
You must be signed in to change notification settings - Fork 0
/
66. Plus One
32 lines (26 loc) · 910 Bytes
/
66. 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
24
25
26
27
28
29
30
31
32
/*
https://leetcode.com/problems/plus-one/description/
Given a non-negative integer represented as a non-empty array of digits, plus one to the integer.
You may assume the integer do not contain any leading zero, except the number 0 itself.
The digits are stored such that the most significant digit is at the head of the list.
*/
public class Solution {
private static final Logger logger = LogManager.getLogger(Solution.class);
public int[] plusOne(int[] digits) {
int size = digits.length;
for (int i = size - 1; i > -1; i--) {
if (digits[i] < 9) {
digits[i]++;
return digits;
} else {
digits[i] = 0;
}
}
if (digits[0] == 0) {
int[] newNumber = new int[size + 1];
newNumber[0] = 1;
return newNumber;
}
return digits;
}
}