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

转载于:https://www.cnblogs.com/asenyang/p/6744410.html