forked from iamshubhamg/Leet-Code
-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathplusone.py
25 lines (19 loc) · 909 Bytes
/
plusone.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
Question Description :
Given a non-empty array of 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: [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.
My Solution :
class Solution:
def plusOne(self, digits: List[int]) -> List[int]:
s = "" #declaring the string
for i in digits:
s += str(i) #adding the numbers in the string
return [x for x in str(int(s) + 1)] # returning the value adding 1 to last digit