070701
题目
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后转为字符,然后把字符按位取出来转为int型后存入array res
- return res
class Solution:
def plusOne(self, digits: List[int]) -> List[int]:
num=0
for i in range(len(digits)):
num=num*10+digits[i]
num+=1
res = []
for i in str(num):
res.append(int(i))
return res
看看大佬们的,看到了一个比较有趣的递归做法:
- 直接判断整数的最后一位是否为9,如果不是,直接最后一位+1;
- 否则,递归调用该函数,这里需要注意,如果输入是9,则递归调用时digits的长度为0,所以当digits的长度为0,令其为1。
class Solution:
def plusOne(self, digits: List[int]) -> List[int]:
if len(digits)== 0:
digits=[1]
elif digits[-1] == 9:
digits = self.plusOne(digits[:-1])
digits.append(0)
else:
digits[-1] += 1
return digits