Given a non-negative number represented as an array of digits, plus one to the number.
The digits are stored such that the most significant digit is at the head of the list.
代码语言：txt复制 public int[] plusOne(int[] digits) {
if (digits == null || digits.length == 0) {
return null;
}
int[] rt = new int[digits.length 1];
digits[digits.length - 1] ;
for (int i = digits.length - 1; i >= 0; i--) {
rt[i 1] = digits[i];
rt[i] = rt[i 1] / 10;
rt[i 1] %= 10;
}
if (rt[0] == 0) {
return Arrays.copyOfRange(rt, 1, rt.length);
} else {
return rt;
}
}
