【JS】一个JS的算法，求大神解答

有如下一个数组
[
{"id": 100006, "value": "40,1666"},
{"id": 100017, "value": "112,113"},
]
期望输出如下结果
['10006:40,100017:112',
'10006:40,100017:113',
'10006:1666,100017:112',
'10006:1666,100017:113',
]

亦或者输入三个或者N个数组
[
{"id": 100006, "value": "40,1666"},
{"id": 100017, "value": "112,113"},
{"id": 100018, "value": "1,2"},
]
能够输出
['10006:40,100017:112',
'10006:40,100017:113',
'10006:40,100018:1',
'10006:40,100018:2',
'10006:1666,100017:112',
'10006:1666,100017:113',
'10006:1666,100018:1',
'10006:1666,100018:2',
'100017:112,100018:1',
'100017:112,100018:2',
'100017:113,100018:1',
'100017:113,100018:2',
]

请问怎么实现这个函数？

附加：最好不论输入数组长度都能正确的输出相应的值（是所有数组的里的值都会被匹配一次），有些答案是固定取值0，1的，期望不要这样。

回答

试了一下仿“纯函数式”的代码：

两两相配(这是答主想要的效果)：

function transform(list) {
  return list.map(i =>
    i.value
    .split(',')
    .map(j => `${i.id}:${j}`)
  ).reduce((acc, current, i, arr) => {
    current.forEach(L => {
      arr
      .filter((_, k) => k > i)
      .forEach(j => {
        j.forEach(R => {
          acc.push(`${L},${R}`)
        })
      })
    })
    return acc
  }, [])
}

另外，附加上NN相配(笛卡儿积)：

function transform(list) {
  return list.map(i =>
    i.value
    .split(',')
    .map(j => `${i.id}:${j}`)
  ).reduce((l, r) => (
    l.length === 0 ?
    r :
    l.map(g =>
      r.map(j =>
        `${g},${j}`
      )
    )
    .reduce((l, r) =>
      l.concat(r), []
    )
  ), [])
}
有如下一个数组 
  [
    {"id": 100006, "value": "40,1666"},
    {"id": 100017, "value": "112,113"},
  ]
期望输出如下结果
  ['10006:40,100017:112',
   '10006:40,100017:113',
   '10006:1666,100017:112',
   '10006:1666,100017:113',
  ]

A

var arr = [
    {"id": 100006, "value": "40,1666"},
    {"id": 100017, "value": "112,113"}
]
var f = arr => {
    return arr.map(item => {
        let id = item.id; 
        return item.value.split(',').map(v => `${id}:${v}`); 
    });
}
var main = arr => {
    let res = f(arr)
    return res[0].reduce((acc, cur) => {
        let temp = res[1].map(e => `${cur},${e}`);
        return acc.concat(temp); 
    }, [])
}

ScreenShot

【JS】一个JS的算法，求大神解答

[
    { 'id': 100006, 'value': '40,1666' },
    { 'id': 100017, 'value': '112,113' },
    { 'id': 100018, 'value': '1,2' }
]
    .map(v => v.value.split(',').map(n => `${v.id}:${n}`))
    .forEach((v, i, arr) => {
        v.forEach(vx => {
            arr.filter((_, j) => j > i).forEach(g => g.forEach(gx => console.log(vx, gx)));
        })
    });
var data = [
    {"id": 100006, "value": "40,1666"},
    {"id": 100017, "value": "112,113"},
  ];
var cache = [];
var output = [];
data.forEach(function(value,index,array){
    //拆分value值
    cache[index] = array[index].value.split(',');
    console.log(cache[index]);
})
for(let i=0;i<cache.length;i++){
    for(let j=0;j<2;j++){
        let text = data[0].id + ':' + cache[0][i] + ',' + data[1].id + ':' + cache[1][j];
        output.push(text);
    }
}
output.forEach(function(value,i,arr){
    console.log(arr[i]);
})
let install = arr => {
    return arr.map(item => {
        let id  = item.id;
        return item.value.split(",").map( val => {
            return `${id}:${val}`;
        });
    });
};
let merge = arr => {
    let temp = [];
    for( let [i,len] = [0,arr.length]; i < len; i++ ){
        for( let j = i + 1; j < len; j++ ){
            let ta = arr[i].reduce((pre,cur) => {
                return [
                    `${pre},${arr[j][0]}`,
                    `${pre},${arr[j][1]}`,
                    `${cur},${arr[j][0]}`,
                    `${cur},${arr[j][1]}`
                ];
            });
            temp = temp.concat(ta);
        }
    }
    return temp;
};
let main = (arr = []) => {
    let nArr = install(arr);
    let result = merge(nArr);
    console.log(result);
};
main([
  {"id": 100006, "value": "40,1666"},
  {"id": 100017, "value": "112,113"},
  {"id": 100018, "value": "1,2"},
]);
//帮2楼完善了下，直接在控制台输出看结果就行了

以上是 【JS】一个JS的算法，求大神解答 的全部内容， 来源链接： utcz.com/a/86293.html

回到顶部