LintCode-407.加一

public class Solution {
    /**
     * @param digits a number represented as an array of digits
     * @return the result
     */
    public int[] plusOne(int[] digits) {
        // Write your code here
        for(int i = digits.length - 1;i >= 0 ;i--){
            if(++digits[i]>9) digits[i] = 0;
            else return digits;
        }
        int[] temp = new int[digits.length + 1];temp[0]=1;
        for(int i = 1; i < temp.length;temp[i++]=0);
        return temp;
    }
}