-
Notifications
You must be signed in to change notification settings - Fork 0
/
66.py
37 lines (28 loc) · 948 Bytes
/
66.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
# 66. Plus One
# Given a non-empty array of digits representing a non-negative integer,
# plus 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 contain a single digit.
# You may assume the integer does not contain any leading zero,
# except the number 0 itself.
# Example 1:
# Input: [1, 2, 3]
# Output: [1, 2, 4]
# Explanation: The array represents the integer 123.
# Example 2:
# Input: [4, 3, 2, 1]
# Output: [4, 3, 2, 2]
# Explanation: The array represents the integer 4321.
from typing import List
class Solution:
def plusOne(self, digits: List[int]) -> List[int]:
carry = 1
for i in range(len(digits)-1, -1, -1):
if carry+digits[i] <= 9:
digits[i] += carry
return digits
else:
digits[i] = 0
digits = [1] + digits
return digits