# C#LeetCode刷题之#66-加一（Plus One）

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.

Input: [1,2,3]

Output: [1,2,4]

Explanation: The array represents the integer 123.

Input: [4,3,2,1]

Output: [4,3,2,2]

Explanation: The array represents the integer 4321.

```public class Program {

public static void Main(string[] args) {
int[] nums = { 1, 3, 5, 6, 9 };

var res = PlusOne(nums);
ShowArray(res);

}

private static void ShowArray(int[] array) {
foreach(var num in array) {
Console.Write(\$"{num} ");
}
Console.WriteLine();
}

private static int[] PlusOne(int[] digits) {
for(int i = digits.Length - 1; i >= 0; i--) {
if(++digits[i] != 10) {
return digits;
} else {
digits[i] = 0;
if(i == 0) {
//增加数组长度，扩容
int[] newDigits = new int[digits.Length + 1];
for(int j = 0; j < digits.Length; j++) {
newDigits[j + 1] = digits[j];
}
newDigits[0] = 1;
return newDigits;
}
}
}
return null;
}

}```

`1 3 5 7 0 `

(1)