【LeetCode】C# 66、Plus One

Given a non-negative integer represented as a non-empty array of digits, plus one to the integer.

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

The digits are stored such that the most significant digit is at the head of the list.

数组加一操作。
思路：加一超过9则进位。到最后一位仍进位则新建加一位数组，使其最后一位为1。

public class Solution {
    public int[] PlusOne(int[] digits) {
        int n = digits.Length;
        for(int i=n-1; i>=0; i--) {
            if(digits[i] < 9) {
                digits[i]++;
                return digits;
            }
            digits[i] = 0;
        }
        int[] newNumber = new int [n+1];
        newNumber[0] = 1;

        return newNumber;
    }
}