leetcode66

public class Solution {
    public int[] PlusOne(int[] digits) {
        var last = digits[digits.Length - 1];

            if (last + 1 < 10)
            {
                digits[digits.Length - 1]++;
                return digits;
            }
            else
            {
                var list = new List<int>();
                int step = 1;
                for (int i = digits.Length - 1; i >= 0; i--)
                {
                    var cur = digits[i];
                    cur = cur + step;
                    if (cur >= 10)
                    {
                        step = 1;
                    }
                    else
                    {
                        step = 0;
                    }

                    list.Add(cur % 10);//原来肯定是9，9+1变为10
                }

                if (step == 1)
                {
                    list.Add(1);
                }
                list.Reverse();
                return list.ToArray();
            }
    }
}

https://leetcode.com/problems/plus-one/#/description

补充一个python的实现：

class Solution:
    def plusOne(self, digits: List[int]) -> List[int]:
        n = len(digits)
        temp = [0] * n
        up = 0
        last = digits[-1]
        last += 1
        if last == 10:
            temp[-1] = 0
            up = 1
        else:
            temp[-1] = last
        
        for i in range(n-2,-1,-1):
            cur = digits[i]
            cur += up
            if cur == 10:
                temp[i] = 0
                up = 1
            else:
                temp[i] = cur
                up = 0
        if up == 1:
            temp.insert(0,1)
        return temp