LeetCode||66. Plus One

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

You may assume the integer do not contain any leading zero, except the number 0 itself.

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

类似于大数相加，不过这是加一，简化版本

class Solution(object):
    def plusOne(self, digits):
        """
        :type digits: List[int]
        :rtype: List[int]
        """
        if not digits:
            return [1]
        if digits[-1]==9:
            res = self.plusOne(digits[:-1])
            res.append(0)
            return res
        else:
            digits[-1] += 1
            return digits