LeetCode---Plus One

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.

给定一个数组，这个数组代表一个数字，数字的最高位存在数组最前面，数字的最低位存在数组的最后面（符合书写习惯），输出该数字加1得到的数组 

设置个flag标志位即可，如果都产生进位，则0位置为1

class Solution:
    def plusOne(self, digits):
        flag = 1
        for i in range(len(digits)-1,-1,-1):
            if digits[i]+flag == 10:
                digits[i]=0
                flag=1
            else:
                digits[i]=digits[i]+flag
                flag=0
        if flag==1:
            digits.insert(0,1)
        return digits