标签:repr most bsp tor int ... style col NPU
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.
int数组转str数组合并成str之后转int+1再转为str再转为str数组再转为int数组(智障了.......)
其实就是变为int值+1再转回去.
class Solution(object): def plusOne(self, digits): """ :type digits: List[int] :rtype: List[int] """ dig = str(int(‘‘.join(str(i) for i in digits)) + 1) return [int(i) for i in dig]
标签:repr most bsp tor int ... style col NPU
原文地址:https://www.cnblogs.com/jeroen/p/9157551.html