leetcode
This commit is contained in:
21
leetcode/66.py
Normal file
21
leetcode/66.py
Normal file
@@ -0,0 +1,21 @@
|
||||
class Solution:
|
||||
def plusOne(self, digits: List[int]) -> List[int]:
|
||||
arr=[]
|
||||
isUp=False
|
||||
|
||||
digits[-1]+=1
|
||||
for i in range(1,len(digits)+1):
|
||||
if isUp:
|
||||
digits[-i]+=1
|
||||
isUp=False
|
||||
|
||||
if digits[-i]>9:
|
||||
isUp=True
|
||||
digits[-i]=0
|
||||
|
||||
if isUp:
|
||||
arr.append(1)
|
||||
for i in digits:
|
||||
arr.append(i)
|
||||
|
||||
return arr
|
||||
Reference in New Issue
Block a user