leetcood学习笔记-66-加一

题目描述：

第一次提交：

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

法二：

class Solution:
    def plusOne(self, digits):
        for i in range(len(digits)):
            digits[i] = str(digits[i])
        nums=''.join(digits)
        nums=int(nums)+1
        nums=str(nums)
        list=[]
        for i in range(len(nums)):
            list.append(int(nums[i]))
        return list

class Solution:
    def plusOne(self, digits):
        '''
        :type digits: List[int]
        :rtype :List[int]
        '''
        d = int(''.join([str(i) for i in digits]))+1
        return [int(i) for i in str(d) ]