Runtime: 52 ms, faster than 35.86% of Python3 online submissions for Plus One.
思路:在list最前面加一个0
然后倒着循环:L[i] + 1
如果结果 = 10 ,那么 L[i] = 0; L[i-1] +1
class Solution:
def plusOne(self, digits):
"""
:type digits: List[int]
:rtype: List[int]
"""
digits.insert(0,0)
# for 这里多余了 可以直接赋值 i = len(digits) - 1
for i in range(len(digits)-1, 0, -1):
digits[i] += 1
while(digits[i] == 10):
digits[i] = 0
i -= 1
digits[i] += 1
if digits[0] == 0:
digits.pop(0)
return digits