LeetCode_06：Plus One

1、总结

• 1、还是要仔细审题，一开始想当然用了数组拼接为字符串再转为Int处理，后来发现Int长度根本不够，还是要一个一个循环遍历处理才行；偷懒不可取啊…
• 2、可能不明显，但其实还是涉及到一些问题，比如数组的拷贝、数组的修改方法等等，需要了解…

2、题目：

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

The digits are stored such that the most significant digit is at the head of the list, and each element in the array contain a single digit.

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

Example 1:

	Input: [1,2,3]
	Output: [1,2,4]
	Explanation: The array represents the integer 123.

Example 2:

	Input: [4,3,2,1]
	Output: [4,3,2,2]
	Explanation: The array represents the integer 4321.

3、自己的解法：

刚开始想当然了，直接数组拼接为字符串然后转int加一，结果倒在了[6,1,4,5,3,9,0,1,9,5,1,8,6,7,0,5,5,4,3]下面，后面偷偷围观了一下discuss，老老实实重新遍历：

	/**
	 * @param {number[]} digits
	 * @return {number[]}
	 */
	var plusOne = function(digits) {
	    let temp = 1;
	    for(let i = digits.length - 1; i >=0; i--){
	        let addR = +digits[i] + temp;
	        if(addR >= 10){
	            digits[i] = 0;
	            temp = 1;
	        } else {
	            digits[i] = addR;
	            temp = 0;
	        }
	    }    
	    let result = [...digits];      
	    if(temp > 0) {
	        result.unshift(temp);
	    }
	    return result;
	};

思考了一下，从尾部向头部逐位加一，如果到第n位没发生进一，则剩下的数据不需要继续遍历，所以加了一个break，算是小小优化吧…

	/**
	 * @param {number[]} digits
	 * @return {number[]}
	 */
	var plusOne = function(digits) {
	    let temp = 1;
	    for(let i = digits.length - 1; i >=0; i--){
	        let addR = +digits[i] + temp;
	        if(addR >= 10){
	            digits[i] = 0;
	            temp = 1;
	        } else {
	            digits[i] = addR;
	            temp = 0;
	            break;
	        }
	    }    
	    let result = [...digits];      
	    if(temp > 0) {
	        result.unshift(temp);
	    }
	    return result;
	};

4、其他解法