题目链接:https://leetcode.com/problems/plus-one
Given a non-negative integer represented as a non-empty array of digits, plus one to the integer.
You may assume the integer do not contain any leading zero, except the number 0 itself.
The digits are stored such that the most significant digit is at the head of the list.
class Solution(object):
def plusOne(self, digits):
"""
:type digits: List[int]
:rtype: List[int]
"""
carry=1
if digits==0: return 1
for j in range(len(digits)-1,-1,-1):
digits[j]+=carry
if digits[j]>=10:
digits[j]-=10
carry=1
else:
carry=0
break
if j==0 and carry==1:
digits.insert(0,1)
return digits