Leetcode解题-Plus One

发表于   |   分类于   |  

描述

Given a non-negative number represented as an array of digits, plus one to the number.

The digits are stored such that the most significant digit is at the head of the list.

分析

没什么好分析的，循环进位。

代码

Python

1
2
3
4
5
6
7
8
9
10
11
12
13
14
class Solution(object):
    def plusOne(self, digits):
        """
        :type digits: List[int]
        :rtype: List[int]
        """
        carry = 1
        for i in xrange(len(digits) - 1, -1, -1):
            s = digits[i] + carry
            carry, r = divmod(s, 10)
            digits[i] = r
        if carry > 0:
            digits.insert(0, 1)
        return digits

热评文章