forked from keon/algorithms
-
Notifications
You must be signed in to change notification settings - Fork 2
/
plus_one.py
38 lines (33 loc) · 812 Bytes
/
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
# Given a non-negative number represented as an array of digits,
# plus one to the number.
# The digits are stored such that the most significant
# digit is at the head of the list.
def plusOne(digits):
"""
:type digits: List[int]
:rtype: List[int]
"""
digits[-1] = digits[-1] + 1
res = []
ten = 0
i = len(digits)-1
while i >= 0 or ten == 1:
sum = 0
if i >= 0:
sum += digits[i]
if ten:
sum += 1
res.append(sum % 10)
ten = sum / 10
i -= 1
return res[::-1]
def plus_one(digits):
n = len(digits)
for i in range(n-1, -1, -1):
if digits[i] < 9:
digits[i] += 1
return digits
digits[i] = 0
new_num = [0] * (n+1)
new_num[0] = 1
return new_num