-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy path66.py
More file actions
37 lines (29 loc) · 1.07 KB
/
66.py
File metadata and controls
37 lines (29 loc) · 1.07 KB
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
from typing import List
# Runtime: 24 ms, faster than 96.98% of Python3 online submissions for Plus One.
# Memory Usage: 14.3 MB, less than 43.85% of Python3 online submissions for Plus One.
class Solution:
def plusOne(_, digits: List[int]) -> List[int]:
return list( map(int, str(int(str(digits)[1:-1].replace(", ", "")) + 1)) )
"""
66. Plus One
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:
Input: digits = [1,2,3]
Output: [1,2,4]
Explanation: The array represents the integer 123.
Example 2:
Input: digits = [4,3,2,1]
Output: [4,3,2,2]
Explanation: The array represents the integer 4321.
Example 3:
Input: digits = [0]
Output: [1]
Constraints:
1 <= digits.length <= 100
0 <= digits[i] <= 9
"""
# Testcase
s = Solution()
print(s.plusOne([1, 2])) # ['1', '3']