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.
class Solution(object):
def plusOne(self, digits):
"""
:type digits: List[int]
:rtype: List[int]
"""
for i in range(1,len(digits)+1):
digits[-i] += 1 #从后往前遍历列表
if digits[-i] > 9: #大于9需要进位
digits[-i] = 0
else:
return digits
return [1]+digits #完全遍历后还没有return,说明原列表中全是9,此时已经被全部转为0,最前面加个[1]就好