Given a non-negative number represented as an array of digits, plus one to the number.
The digits are stored such that the most significant digit is at the head of the list.
1,解法。 如果最后一位加1大于9，那么最后一位／10会有余数，利用这个特点进行plus one
public class Solution { public int[] plusOne(int[] digits) { int add=1; for(int i=digits.length-1;i>=0&&add>0;i--){ int temp=digits[i]+add; digits[i]=temp%10; add=temp/10; } if(add==0){ return digits; } int[] result=new int[digits.length+1]; result[0]=1; for(int j=1;j<result.length;j++){ result[j]=digits[j-1]; } return result; } }
原文：http://www.cnblogs.com/lilyfindjobs/p/4073388.html