-
Notifications
You must be signed in to change notification settings - Fork 0
/
60-plus-one.py
40 lines (33 loc) · 1.12 KB
/
60-plus-one.py
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
'''
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(object):
def plusOne(self, digits):
"""
:type digits: List[int]
:rtype: List[int]
"""
leastSignificantIdx = len(digits) - 1
for i in range(leastSignificantIdx, -1, -1):
if (digits[i] < 9):
digits[i] += 1
return digits
else:
# Digit is 9, need to continue iterating to carry the 1
digits[i] = 0
# All digits were 9s, add a 1 to the front (ex. 999 becomes 1000)
digits.insert(0, 1)
return digits