Given a number represented as an array of digits, plus one to the number.
public class Solution {
public int[] plusOne(int[] digits) {
if (digits == null || digits.length == 0) return null;
boolean allNine = true;
for (int i = 0; i < digits.length; i++) {
if (digits[i] != 9) {
allNine = false;
break;
}
}
int[] result;
if (allNine == true) {
result = new int[digits.length + 1];
result[0] = 1;
return result;
} else {
result = new int[digits.length];
}
int value = 0;
int extra = 0;
for (int i = digits.length - 1; i >= 0; i--) {
if (i == digits.length - 1) {
value = digits[i] + extra + 1;
} else {
value = digits[i] + extra;
}
extra = value / 10;
value = value % 10;
result[i] = value;
}
return result;
}
}