多重数组循环

[bennman]

var arr=[[[[11,22],33],44],[55,66],77];
var arr2=[];
//......
console.log(arr2)
怎么让arr2的值等于11,22,33,44,55,66,77 注意arr为层数不确定的多重数组，可能是4重，5重，6重....

[foolbirdflyfirst]

arr.toString()不行么？

[foolbirdflyfirst]

var arr2 = arr.toString().split(',');

[挨踢直男]

var arr=[[[[11,22],33],44],[55,66],77];
function loop(arr)
{
    var result ="";
    for(var i = 0 ; i < arr.length ; i ++)
	{
	    if(arr[i] instanceof Array) result += loop(arr[i])
		else result += arr[i].toString()+"<br/>";
	}
	return result;
}
document.write(loop(arr))

用递归

[挨踢直男]

var arr=[[[[11,22],33],44],[55,66],77];
var arr2 = [];
function loop(arr)
{
    var result =[];
    for(var i = 0 ; i < arr.length ; i ++)
	{
	    if(arr[i] instanceof Array) result = result.concat(loop(arr[i]));
		else result.push(arr[i]);
	}
	return result;
}
arr2 = loop(arr);
alert(arr2)

[峭沙]

		var arr = [[[[11,22],33],44],[55,66],77],
			arr2 = [];
		function cloneArray(target, source){
			for(var i = 0, len = source.length; i < len; i++){
				var el = source[i];
				if(Object.prototype.toString.call(el) === "[object Array]"){
					cloneArray(target, el);
				}else{
					target.push(el);
				}
			}
		}
		cloneArray(arr2, arr);
		console.log(arr2);

[上山浦鱼]

<script>
var arr=[[[[11,22],33],44],[55,66],77];
var arr2=[];
var item = arr;
var str = "";
while(item.lenght == 2) {
str = str + item[1] + ",";
item = item[0];
}
str = str + item + ",";

arr2 = str.split(",");
alert(str);
</script>

将上面SCRIPT复制,运行, 得到结果 11,22,33,44,55,66,77,
细节方面,自己处理..

[Acesidonu]

<script type="text/javascript">
	var arr=[[[[11,22],33],44],[55,66],77];
	var arr2=arr.join(',').split(',');
	alert(arr2);
</script>

[bennman]

[Quote=引用 4 楼 的回复:]

JScript code
var arr=[[[[11,22],33],44],[55,66],77];
var arr2 = [];
function loop(arr)
{
var result =[];
for(var i = 0 ; i < arr.length ; i ++)
{
if(arr[i] instanceof Array) resu……
[/Quote]

递归的好，毕竟我要处理每一层的结果，谢谢各位！

[prototyper]

应该递归

Array.prototype.each = function() {
    var ret = []; 
    (function(arr) {
        for (var i = 0; arr[i]; i++) {
            arr[i].constructor == Array ? arguments.callee(arr[i]) : ret.push(arr[i]);
        }
    })(this);
    return ret
}

alert([[[[11, 22], 33], 44], [55, 66], 77].each())

[thiswolf]

递归效率慢啊，我的程序用递归和直接用循环嵌套运行时间相差10倍。