[磋商]“请进来”文化外宣活动 成交公告

014/1210_36

https://leetcode.com/problems/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, after adding one, it becomes 124.
Example 2:

Input: digits = [4,3,2,1]
Output: [4,3,2,2]
Explanation: The array represents the integer 4321, after adding one, it becomes 4322.
Example 3:

Input: digits = [9]
Output: [1,0]
Explanation: The array represents the integer 9, after adding one, it becomes 10.

Constraints:

1 <= digits.length <= 100
0 <= digits[i] <= 9

class Solution:
def plusOne(self, digits: List[int]) -> List[int]:

l = len(digits)

if l == 1:
if digits[0] == 9:
return [1,0]
else:
return [digits[0]+1]
else:
i = l - 1
while i >= 0:
if digits[i] == 9:
digits[i] = 0
else:
digits[i] = digits[i] + 1
break
i -= 1

if i == -1:
return [1] + digits
else:
return digits

class Solution:
def plusOne(self, digits: List[int]) -> List[int]:

l = len(digits)

if l == 1:
if digits[0] == 9:
return [1,0]
else:
return [digits[0]+1]
else:
i = l - 1
while i >= 0:
if digits[i] == 9:
digits[i] = 0
else:
digits[i] = digits[i] + 1
break
i -= 1

if i == -1:
return [1] + digits
else:
return digits