JavaScript-递归纪要

递归使用过程中的两个先决条件：
    1. 要递归的条件。
    2. 递归结束的条件。

 

/**
 * [thisArr 结构化一个匿名函数;]
 * @param  {[type]} arr [入参]
 * @return {[type]}     [description]
 */
var thisArr = function(arr) {
	var new_arr = [];
	for (var i = 0; i < arr.length; i++) {
	
		if (Array.isArray(arr[i])) {
			
			// 合并数组:arr.push.apply(arr,arrB);
			new_arr.push.apply(new_arr,thisArr(arr[i]));
		} else {
			new_arr.push(arr[i]);
		}
	}
	return new_arr;
};

var arr = [1,2,3,4,5,["a","b","c","d","e",["A","B","C","D","E",["FIRST","SECOND","THIRED","FOURED","FIRED"]]]];
thisArr(arr);

console.log(thisArr(arr));