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.
习题解析:
给定一个非负整数组成的非空数组,在该数的基础上加一,返回一个新的数组。
最高位数字存放在数组的首位, 数组中每个元素只存储一个数字。
这道题我采用了Discuss里面的一个方法:从数组末尾向前进行循环,若是该位置数字为9,则该位置数字变为零,循环继续,若该位置不是9,则加一并返回数组。若是循环到数组的0号位置,则将该位置置1,并在数组末尾加一个0
Python代码:
class Solution:
def plusOne(self, digits):
"""
:type digits: List[int]
:rtype: List[int]
"""
i = len(digits) - 1
while i >= 0:
if digits[i] == 9:
digits[i] = 0
else:
digits[i] = digits[i] + 1
return digits
i = i - 1
digits[0] = 1
digits.append(0)
return digits