本文共 545 字，大约阅读时间需要 1 分钟。

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

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

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

转载地址：http://yzqmi.baihongyu.com/