Your browser does not seem to support JavaScript. As a result, your viewing experience will be diminished, and you have been placed in read-only mode.

Please download a browser that supports JavaScript, or enable it if it's disabled (i.e. NoScript).

class Solution(object): def plusOne(self, digits): carry = 1 for i in range(len(digits))[::-1]: carry, digits[i] = (digits[i] + carry) / 10, (digits[i] + carry) % 10 return digits if not carry else [carry] + digits

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