Simple Python solution; Easy to understand


  • 1
    K
        if digits==[]:
            return []
        i=1
        while i<(len(digits)+1):
            if digits[-i]!=9:
                digits[-i]+=1
                return digits
            else:
                digits[-i]=0
                i=i+1
        digits.insert(0,1)
        return digits

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.