标签：
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 carry=1; for(int i=digits.length-1;i>=0;i--){ int d=digits[i]+carry; digits[i]=d%10; carry=d/10; if(carry==0){ return digits; } } int[] res=new int[digits.length+1]; res[0]=1; return res; } }
标签：
原文地址：http://www.cnblogs.com/joannacode/p/4421237.html
