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 1:

Example 2:

注意：本題主要是模擬加法運算過程，c為進位。特殊的當陣列為[9, 9]，最後的輸出應該是[1, 0, 0]，需要自己重新定義一個新陣列封裝最後的資料

class Solution(object):
    def plusOne(self, digits):
        """
        :type digits: List[int]
        :rtype: List[int]
        """
        c = 1
        for i in range(len(digits) - 1, -1, -1):
            if digits[i] + c >= 10:
                c = 1
                digits[i] = 0
            else:
                digits[i] += c
                c = 0
                break
        if c == 1:
            num = [1]
            for e in digits:
                num.append(e)
            return num
        
        return digits