class Solution(object):
# def plusOne(self, digits):
# """
# :type digits: List[int]
# :rtype: List[int]
# """
# ls = len(digits)
# curr, pos = 1, 0
# while pos < ls:
# index = ls - pos - 1
# curr += digits[index]
# digits[index] = curr % 10
# curr /= 10
# if curr == 0:
# # do not need to continue
# break
# pos += 1
# if curr > 0:
# digits.insert(0, curr)
# return digits
def plusOne(self, digits):
ls = len(digits)
for index in reversed(range(ls)):
if digits[index] < 9:
digits[index] += 1
# do not need to continue
return digits
else:
# 10
digits[index] = 0
digits.insert(0, 1)
return digits
Download Plus One.pyLeetcode 066 Plus One problem solution in python3 with explanation. This is the best place to expand your knowledge and get prepared for your next interview.
Feedback is the most important part of any website.
If you have any query, suggestion or feedback, Please feel free to contact us.