JavaScript小算法！

Question

给定一个Javascript二维数组，如何得到其笛卡尔积。varTest=newArray();Test[0]=newArray(1,2,3);Test[1]=newArray(4,5,6);求大神解答！

Answer 1

改编了一个大神给的解决方案！
vardata=newArray(newArray(1,2,3),newArray(4,5,6));
varresult=[];
console.log(data);
functiondescartes(arrIndex,aresult){
if(arrIndex>=data.length){
result.push(aresult);
return;
}
varaArr=data[arrIndex];
for(vari=0;ivartheResult=aresult.slice(0,aresult.length);
theResult.push(aArr[i]);
descartes(arrIndex+1,theResult);
}
}
descartes(0,[]);
console.log(result);
                            

Answer 2

不就是循环一下么
functiondescartes(dimensionX,dimensionY){
varxLen,yLen;
if(!(xLen=dimensionX.length)||!(yLen=dimensionY.length))return[];
varproducts=[];
for(vari=0;ifor(varj=0;jproducts.push([dimensionX[i],dimensionY[j]])
}
}
returnproducts;
}
是这个意思么