题目:
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.
解析:
这一道题的主要解决就是如果本来的列表的位数不够,需要添加一位,以及加1之后需要对进位进行处理
class Solution:
def plusOne(self, digits):
"""
:type digits: List[int]
:rtype: List[int]
"""
digits = [0] + digits
one = 1
size = len(digits) - 1
while one:
one = (digits[size] + 1) // 10
digits[size] = (digits[size] + 1) % 10
size -= 1
if digits[0]:
return digits
else:
return digits[1:]