LeetCode-66-Plus One(水题/数值计算)-Easy

public class Solution {
public int[] plusOne(int[] digits) {
int len=digits.length;
int[] ans= new int[len];

int carry=0;
for(int i=len-1; i>=0; i--){
int addOne;
if(i==len-1){
addOne=carry+digits[i]+1;
}else{
addOne=carry+digits[i];
}
ans[i]=(addOne)%10;
carry=(addOne)/10;
}

if(carry!=0){
int[] rst=new int[len+1];
rst[0]=carry;
for(int i=0; i<len; i++){
rst[1+i]=ans[i];
}
ans=rst;
}

return ans;
}
}