66. Plus One

class Solution {
    public int[] plusOne(int[] digits) {
        if(digits == null || digits.length == 0){
            return digits;
        }
        
        for(int i=digits.length-1; i>=0; i--){
            if(digits[i] < 9){
                digits[i]++;
                break;
            } else {
                digits[i] = 0;
            }
        }
        
        if(digits[0] == 0){
            int[] res = new int[digits.length + 1];
            res[0] = 1;
            return res;
        }
        return digits;
    }
}

 

转载于:https://my.oschina.net/u/3457852/blog/1538643