Leetcode - Plus One Solution
Poor Man
- Published
- Updated
- Reading time
- 1 min read
- Length
- 155 words
Given a non-empty array of decimal digits representing a non-negative integer, increment one to the integer.
The digits are stored such that the most significant digit is at the head of the list, and each element in the array contains a single digit.
You may assume the integer does not contain any leading zero, except the number 0 itself.
Example 1:
Text
Input: digits = [1,2,3]
Output: [1,2,4]
Explanation: The array represents the integer 123.Example 2:
Text
Input: digits = [4,3,2,1]
Output: [4,3,2,2]
Explanation: The array represents the integer 4321.Example 3:
Text
Input: digits = [0]
Output: [1]Constraints:
1 <= digits.length <= 1000 <= digits[i] <= 9
Solution in Python#
Python
class Solution:
def plusOne(self, digits: List[int]) -> List[int]:
num = 1
i = 0
for d in reversed(digits):
num += d*10**i
i += 1
new = deque()
while num:
num,r = divmod(num,10)
new.appendleft(r)
return new