# Leetcode 66. Plus One

## 題解

class Solution:
    def plusOne(self, digits: List[int]) -> List[int]:
        output = []
        n = len(digits)
        prev = 0
        digits[-1] += 1
        for i in range(n-1,-1,-1):
            num = digits[i] + prev
            digits[i] = num % 10
            prev = num // 10
            output.append(digits[i])
        if prev != 0:
            output.append(prev)
        return output[::-1]