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 9 输出 2 0

简单题，直接上代码：

public class Solution {
    	 public int[] plusOne(int[] digits) {
	     boolean flag = true;
	        int len = digits.length-1;
	        while(flag&&len>=0)
	        {
	            digits[len]++;
	            flag = false;
	            if(digits[len]>=10)
	            {
	                digits[len]-=10;
	                flag = true;
	            }
	            len--;
	        }
	        if(flag)
	        {
		        int []  a = new int[digits.length+1];
	            for(int i=1;i<digits.length;i++)
	            {
	                a[i]=digits[i-1];
	            }
	            a[0]=1;
	            return a;
	        }
	        else return digits;
	    }
}

LeetCode Plus One