【leetcode】(python) 66. Plus One加一

66. Plus One Easy

Description

Given a non-empty array of digits representing a non-negative integer, plus 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 contain a single digit.

You may assume the integer does not contain any leading zero, except the number 0 itself.

Example

• 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.

题意

将非空整数数组加一后返回结果值

解题思路1

从后往前遍历，分类判断该位上的值是否为9，若为9则置该位为0，index继续向前；否则直接加1。到index为0处考虑特殊情况，如[9,9,9] 加 1 后为[1,0,0,0]，总长度加1 且首位为1。很简单的实现，这题主要要想到从后往前开始遍历。

code

class Solution:
    def plusOne(self, digits: List[int]) -> List[int]:
        if len(digits) == 0:
            return digits
        index =  len(digits)-1
        while index >= 0:
            if index == 0:
                if digits[index] == 9:
                    digits[index] = 0
                    return [1] + digits
                else:
                    digits[index] += 1
                    return digits
            if digits[index] == 9:
                    digits[index] = 0
                    index -= 1
            elif digits[index] != 9:
                digits[index] += 1
                return digits