-
Notifications
You must be signed in to change notification settings - Fork 1.5k
/
Copy path066_Plus_One.py
35 lines (32 loc) · 931 Bytes
/
066_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
class Solution(object):
# def plusOne(self, digits):
# """
# :type digits: List[int]
# :rtype: List[int]
# """
# ls = len(digits)
# curr, pos = 1, 0
# while pos < ls:
# index = ls - pos - 1
# curr += digits[index]
# digits[index] = curr % 10
# curr /= 10
# if curr == 0:
# # do not need to continue
# break
# pos += 1
# if curr > 0:
# digits.insert(0, curr)
# return digits
def plusOne(self, digits):
ls = len(digits)
for index in reversed(range(ls)):
if digits[index] < 9:
digits[index] += 1
# do not need to continue
return digits
else:
# 10
digits[index] = 0
digits.insert(0, 1)
return digits