66. 加一 —— LeetCode (python,击败98.17%)

# encoding = utf-8
# 开发者：Alen
# 开发时间： 17:42 
# "Stay hungry，stay foolish."

class Solution(object):
    def plusOne(self, digits):
        """
        :type digits: List[int]
        :rtype: List[int]
        """
        len1 = len(digits)
        jingw = 0
        n = 1
        for i in range(1, len1 + 1):
            if digits[-i] ==9:
                if i == len1:
                    digits[-i] = 0
                    digits.insert(0, 1)
                    break
            tep = digits[-i] + n + jingw
            jingw = 0
            if tep >= 10:
                jingw = 1
                tep = 0
            digits[-i] = tep
            n = 0
            if jingw == 0:
                break
        return digits


if __name__ == '__main__':
    s = Solution()
    print(s.plusOne([9,8,9]))