多重数组笛卡尔积

2019独角兽企业重金招聘Python工程师标准>>>

 

<script>
(function(){

       dwn = function(a){document.writeln(a+"<br />")};

        //笛卡尔积

       var Cartesian = function(a,b){

              var ret=[];

             for(var i=0;i<a.length;i++){

                      for(var j=0;j<b.length;j++){

                               ret.push(ft(a[i],b[j]));
                      }

              }

               return ret;

       }

       var ft = function(a,b){

               if(!(a instanceof Array))

                       a = [a];

              var ret = Array.call(null,a);

              ret.push(b);

              return ret;

      }

       //多个一起做笛卡尔积

       multiCartesian = function(data){

               var len = data.length;

               if(len == 0)

                      return [];

               else if(len == 1)

                      return data[0];

               else{

                      var r=data[0];

                       for(var i=1;i<len;i++){

                                r=Cartesian(r,data[i]);

                       }

                        return r;

               }

       }

})();


var data=[['a','b','c'],[1,2,3,4],['A','B'],['#','@','+'],['Mary','Terry','KYO']];

var r = multiCartesian(data);

for(var i=0;i<r.length;i++){

        dwn("("+r[i]+")");
}

</script>

 

 

转载于:https://my.oschina.net/HuifengWang/blog/232951