plus-one 发表于 2018-04-30 | 分类于 algorithm , leetcode | 阅读次数 | 1234567891011121314151617181920212223242526272829303132"""https://leetcode.com/problems/plus-one/description/"""class Solution(object): def plusOne(self, digits): """ :type digits: List[int] :rtype: List[int] >>> s = Solution() >>> s.plusOne([1, 2, 3]) [1, 2, 4] >>> s.plusOne([4, 3, 2 ,1]) [4, 3, 2, 2] >>> s.plusOne([1, 9, 9]) [2, 0, 0] >>> s.plusOne([9, 9, 9]) [1, 0, 0, 0] """ if digits == [0]: return [1] idx = len(digits) - 1 while True: digits[idx] += 1 if digits[idx] != 10: return digits else: digits[idx] = 0 idx -= 1 if idx == -1: return [1] + digits Donate WeChat Pay Alipay