leetcode python 66. 加一

https://leetcode-cn.com/problems/plus-one/description/
我的做法是先把list处理成int，再把int+1后，转回list

class Solution(object):
    def plusOne(self, digits):
        """
        :type digits: List[int]
        :rtype: List[int]
        """
        d= 1
        sum = 0
        while 1:
            if len(digits)==0:
                break
            sum = sum+digits[-1]*d
            d = d*10
            digits= digits[:-1]
        sum+=1
        l =[]
        while 1:
            if sum == 0:
                break
            x=sum%10
            l.append(x)
            sum=int(sum/10)

        l = l[::-1]
        return l

看了下其他人的解法，看着也都是比较麻烦的处理操作