<p><strong>我有一个像这样的数组</strong></p> <pre class="brush:php;toolbar:false;">const input_array= [ ["schwarz", "blau"], ["groß", "mittel"], ["a", "b", "c"] //... ist es dynamisch, es können viele Zeilen hinzugefügt werden ];</pre> <p><strong>我该如何得到一个像这样的数组：</strong></p> <pre class="brush:php;toolbar:false;">const finallist = [ ["schwarz", "groß", "a"], ["schwarz", "groß", "b"], ["schwarz", "groß", "c"], ["schwarz", "mittel", "a"], ["schwarz", "mittel", "b"], ["schwarz", "mittel", "c"], ["blau", "groß", "a"], ["blau", "groß", "b"], ["blau", "groß", "c"], ["blau", "mittel", "a"], ["blau", "mittel", "b"], ["blau", "mittel", "c"], ]</pre> <p><strong>请记住input_array是动态的</strong></p> <p><strong>请告诉我如何做到这一点</strong></p>

const input_array = [
    ["black", "blue"],
    ["large", "medium"],
    ["a", "b", "c"]
]
const getCompinations = array =>
  array.reduce((v, b) =>
    v.reduce((r, g) => [...r, ...b.map(w => [].concat(g, w))], [])
  )
console.log(getCompinations(input_array))

const input_array = [
    ["black", "blue"],
    ["large", "medium"],
    ["a", "b", "c"]
    //... 是否可以动态添加多行
];
const mmc = input_array.reduce((e, r) => e * r.length, 1);
const finallist = input_array.map((x,i)=>({index:i,arr:x})).reduce((e, r) => {
    for (var u = 0; u  e[u].includes(r)) || e[u].length 
小心！ 在大规模矩阵中可能会导致浏览器崩溃。