问题描述:
Given a non-negative integer represented as a non-empty array of digits, plus one to the integer.
You may assume the integer do not contain any leading zero, except the number 0 itself.
The digits are stored such that the most significant digit is at the head of the list.
思路:
从最后一位开始运算,如果数字小于9,直接加1,结束;如果等于9,该位数字置0,继续将前一位加1。如此继续,如果所有的数字都为9,最后所以位置都为0,可新开一个长度+1的数组,,首位设为1.
代码:
class Solution {
public int[] plusOne(int[] digits) {
int len = digits.length;
for(int i = len - 1; i >= 0; i--){
if(digits[i] < 9){
digits[i]++;
return digits;
}
digits[i] = 0;
}
int[] allNew = new int[len+1];
allNew[0] = 1;
return allNew;
}
}