11月3日
class Solution {
public int[] plusOne(int[] digits) {
int i = digits.length-1;
digits[i]+=1;
boolean f = false;
while(digits[i]==10){
digits[i]=0;
i--;
if(i<0){
f = true;
break;
}
digits[i]+=1;
}
if(f==true){
int[] newDights = new int[digits.length+1];
newDights[0]=1;
for(int j=1;j<newDights.length;j++){
newDights[j] = digits[j-1];
}
return newDights;
}
return digits;
}
}