-
Notifications
You must be signed in to change notification settings - Fork 47
/
Copy path66.plus-one.java
62 lines (59 loc) · 1.24 KB
/
66.plus-one.java
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
48
49
50
51
52
53
54
55
56
57
58
59
60
61
/*
* @lc app=leetcode id=66 lang=java
*
* [66] Plus One
*
* https://leetcode.com/problems/plus-one/description/
*
* algorithms
* Easy (40.70%)
* Total Accepted: 373K
* Total Submissions: 910.9K
* Testcase Example: '[1,2,3]'
*
* Given a non-empty array of digits representing a non-negative integer, plus
* one to the integer.
*
* The digits are stored such that the most significant digit is at the head of
* the list, and each element in the array contain a single digit.
*
* You may assume the integer does not contain any leading zero, except the
* number 0 itself.
*
* Example 1:
*
*
* Input: [1,2,3]
* Output: [1,2,4]
* Explanation: The array represents the integer 123.
*
*
* Example 2:
*
*
* Input: [4,3,2,1]
* Output: [4,3,2,2]
* Explanation: The array represents the integer 4321.
*
*/
class Solution {
public int[] plusOne(int[] digits) {
int carry = 1;
int len = digits.length;
for (int i = len - 1; i >= 0; i--) {
int sum = digits[i] + carry;
digits[i] = sum % 10;
carry = sum / 10;
if (carry == 0) {
break;
}
}
if (carry > 0) {
int[] result = new int[len + 1];
result[0] = 1;
return result;
} else {
return digits;
}
}
}