这道题和之前的Add Binary要跟着一起复习。
public class Solution {
public int[] plusOne(int[] digits) {
if (digits == null || digits.length == 0) {
return digits;
}
int carry = 0;
for (int index = digits.length - 1; index >= 0; index--) {
int num = digits[index];
int sum = (num + 1) % 10;
carry = (num + 1) / 10;
digits[index] = sum;
if (carry == 0) {
return digits;
}
}
if (carry == 1) {
int [] newResult = new int[digits.length + 1];
newResult[0] = 1;
return newResult;
}
return digits;
}
}