标签：style blog color io os ar for sp div
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.
Solution:
public class Solution { public int[] plusOne(int[] digits) { int N=digits.length; int add=1; for(int i=N-1;i>=0;--i){ int temp=digits[i]+add; digits[i]=temp%10; add=temp/10; if(add==0) return digits; } int[] result=new int[N+1]; result[0]=1; for(int i=1;i<N+1;++i) result[i]=0; return result; } }
标签：style blog color io os ar for sp div
原文地址：http://www.cnblogs.com/Phoebe815/p/4052098.html
