题目描述:
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.
思路:
比较简单的想法就是通过类型string,list,int三种类型的转化进行改变。不过这样运行时间很长。
还有一种方法就是将list倒序读入,判断是否是9,是9就变0,不是9进行+1操作并直接返回list。但最后需要考虑的一种情况是例如999变1000。因为多出了一位,所以直接将第一位变1,最后append一个0即可。
代码1:
class Solution:
def plusOne(self, digits):
string = ""
for i in digits:
string += str(i)
new_string = str(int(string)+1)
res = []
for i in new_string:
res.append(int(i))
return res
代码2:
class Solution:
def plusOne(self, digits):
for i in reversed(range(len(digits))):
if digits[i] == 9:
digits[i] = 0
else:
digits[i] += 1
return digits
digits[0] = 1 #000 --> 100
digits.append(0) #100 --> 1000
return digits
知识点:
for循环中倒序读入可采用reversed()方法。如果倒序读入位置,则reversed(range(x1,x2))。如果倒序读入数值或元素,则reversed(list)。