66. Plus One

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，进行进位，我就按照这个理解来写的了～

/**
 * @param {number[]} digits
 * @return {number[]}
 */
var plusOne = function(digits) {
    digits[digits.length-1]+=1;
    for(var i=digits.length-1;i>0;i--){
        if(digits[i]>9){
            digits[i]-=10;
            digits[i-1]++;
        }
    }
    if(digits[0]>9){
        digits[0]-=10;
        return [1].concat(digits);
    }
    return digits;
};