Python beats 99%


  • 0
    E

    class Solution(object):

    def plusOne(self, digits):
    	for i in xrange(len(digits)-1,-1,-1):
    		if digits[i] < 9:
    			digits[i] = digits[i] + 1
    			return digits
    		digits[i] = 0
    	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.