[LeetCode By Python]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.

---

举例：输入［1，1，1，1，1］   输出［1，1，1，1，2］

代码＋调试：

class Solution(object):
    def plusOne(self, digits):
        """
        :type digits: List[int]
        :rtype: List[int]
        """
        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
                break
        if flag ==1:
            digits.insert(0,1)
        return digits
a = Solution()
print a.plusOne([1,2,2,2,2,0])