抄一篇算法题
题目如下
Given a non-empty array of digits representing a non-negative integer, increment one to the integer.
The digits are stored such that the most significant digit is at the head of the list, and each element in the array contains a single digit.
You may assume the integer does not contain any leading zero, except the number 0 itself.
Example 1:
Input: [1,2,3]
Output: [1,2,4]
Explanation: The array represents the integer 123.
Example 2:
Input: [4,3,2,1]
Output: [4,3,2,2]
Explanation: The array represents the integer 4321.
from:leetCode.com
summary:
1.know this explain
2.see the english version
3.diff the 0-8 plus One and nine plusOne
Code:
class Solution {
public int[] plusOne(int[] digits) {
for(int i = digits.length-1; i>=0 ;i--){
digits[i]++;
digits[i] = digits[i]%10;
if(digits[i]%10!=0){
return digits;
}
}
int[] res = new int[digits.length+1];
res[0] = 1;
return res;
}
}