66.加1 （进位法）

class Solution:
    def plusOne(self, digits: List[int]) -> List[int]:
        n = len(digits)
        up = 0
        for i in range(n-1,-1,-1):
            if i == n-1:
                #最后一个数字加1，记录进位。up一定再digits[i]赋值前面
                temp = (digits[i] + 1) % 10
                up = (digits[i] + 1) // 10
                digits[i] = temp
            else:
                temp = (digits[i] + up) % 10
                up = (digits[i] + up) // 10
                digits[i] = temp
        if up != 0:
            digits.insert(0,1)
        return digits