题目网址:https://leetcode.cn/leetbook/read/top-interview-questions-easy/x2cv1c/
public class Solution {
public int[] PlusOne(int[] digits) {
digits[digits.Length -1] += 1;
int[] arr = new int[digits.Length+1];
for(int i=digits.Length-1; i>=0; i--)
{
if(digits[i] == 10)
{
if (i - 1 >= 0)
{
digits[i - 1] = digits[i - 1] + 1;
digits[i] = 0;
}
else
{
arr[0] = 1;
digits[0] = 0;
for(int j = 0; j < digits.Length; j++)
{
arr[j+1]=digits[j];
return arr;
}
}
}
}
return digits;
}
}
![](https://img-blog.csdnimg.cn/img_convert/f1a516b0bd4860045229e2b8c3822313.png)