Plus One
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.
解题思路:
这道题没啥好说的....
public class Solution {
public int[] plusOne(int[] digits) {
int addnum = 1;
for(int i = digits.length-1;i>=0;i--)
{
int a = digits[i]+addnum;
addnum = a/10;
digits[i] = a%10;
}
if(addnum == 1)
{
int[] result = new int[digits.length+1];
result[0] = addnum;
for(int i = 1;i<=digits.length;i++)
result[i] = digits[i-1];
return result;
}
return digits;
}
}