moonlightshadow123
5/30/2017 - 3:12 PM

66. Plus One

  1. Plus One
carrier.py
content_copyfile_download
class Solution(object):
    def plusOne(self, digits):
        """
        :type digits: List[int]
        :rtype: List[int]
        """
        carry = 1
        for i in range(len(digits)-1, -1, -1):
            if carry == 0:
                break
            if digits[i] == 9:
                digits[i] = 0
            else:
                digits[i] += 1
                carry = 0
        if carry == 1:
            digits.insert(0,1)
        return digits
66-Plus-One.md
content_copyfile_download
  • Rendered
  • Source

https://leetcode.com/problems/plus-one/

Given a non-negative integer represented as a non-empty array of digits, plus one to the integer.

You may assume the integer do not contain any leading zero, except the number 0 itself.

The digits are stored such that the most significant digit is at the head of the list.