66. Plus One

Given a non-negative integer represented as a non-empty array of digits, plus one to the integer.

You may assume the integer do not contain any leading zero, except the number 0 itself.

The digits are stored such that the most significant digit is at the head of the list.

不是简单的数组末尾加一，要考虑到199的情况，那时候就要申请长度比原数组大1的新数组。

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] += 1;

            return digits;

        }
        else{

            digits[i] = 0;

        }
    }

        //in case of 999
        int[] array = new int[digits.length + 1];
        array[0] = 1;
        return array;


}

}