题目:
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.
我的解法:
def plusOne(self, digits):
i = -1
index = -1*len(digits)
while i >= index and digits[i] == 9:
digits[i] = 0
i -= 1
if i < index:
digits.insert(0, 1)
else:
digits[i] += 1
return digits
参考
carry=1
for i in range(len(digits)-1, -1, -1):
digits[i]+=carry
if digits[i] > 9:
digits[i]-=10
carry=1
else:
carry=0
if carry == 0:
break
if carry == 1:
digits.insert(0, 1)
return digits
--------------新手刷题,仅用于自身记录,如有错误,欢迎指出---------------