数组初始化int[] newDigits = new int[newLength];
class Solution {
public int[] plusOne(int[] digits) {
int i = digits.length-1;
while(i>=0){
if(digits[i]!=9){digits[i]++;return digits;}
else{
digits[i]=0;i--;
}
}
int newLength = digits.length+1;
int[] newDigits = new int[newLength];
newDigits[0]=1;
for(int j=1;j<newLength;j++){
newDigits[j]=0;
}
return newDigits;
}
}
