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

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. 题意：给一个非负数，用数组表示，加1返回结果 思路：设定进位，从数组最后一个数开始和进位相加，判断是向下一位进位，还是自身是否加1 最后需要判断最高位是否进位，若进位则在数组开头插入1 Runtime: 55 ms

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

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