public class Solution {
public int[] plusOne(int[] digits) {
int carriers = 1;
for (int i = digits.length - 1; i >= 0 && carriers > 0; i--) {
int sum = digits[i] + carriers;
digits[i] = sum % 10;
carriers = sum / 10;
}
if (carriers == 0) {
return digits;
}
int[] rst = new int[digits.length + 1];
rst[0] = 1;
for (int i = 1; i < rst.length; i++) {
rst[i] = digits[i - 1];
}
return rst;
}
}