zoukankan html css js c++ java

商品sku的排列组合

<!DOCTYPE html>
<html lang="en">

<head>
    <meta charset="UTF-8">
    <meta name="viewport" content="width=device-width, initial-scale=1.0">
    <meta http-equiv="X-UA-Compatible" content="ie=edge">
    <title>商品sku</title>
</head>

<body>
    <script>
        const names = ['iphoneX', 'iphoneXs'];
        const colors = ['黑色', '白色'];
        const sizes = ['64G', '128G'];
        // const res = [
        //     ['iphoneX', '黑色', '64G'],
        //     ['iphoneX', '黑色', '128G'],
        //     ['iphoneX', '白色', '64G'],
        //     ['iphoneX', '白色', '128G'],
        //     ['iphoneXs', '黑色', '64G'],
        //     ['iphoneXs', '黑色', '128G'],
        //     ['iphoneXs', '白色', '64G'],
        //     ['iphoneXs', '白色', '128G']
        // ]
        const all = [names, colors, sizes]
        let combine = function (all) {
            if (all.length < 2) {
                return all[0] || []
            }
            return all.reduce((pre, cur) => {
                let res = []
                pre.forEach(p => {
                    cur.forEach(c => {
                        let t = [].concat(Array.isArray(p) ? p : [p])
                        t.push(c)
                        res.push(t)
                    });
                });
                return res
            })
        }
        // let combine = function (all) {
        //     let res = []
        //     let fn = function (itemIndex, prev) {
        //         let item = all[itemIndex]
        //         let isLast = itemIndex === all.length - 1
        //         for (const val of item) {
        //             let cur = prev.concat(val)
        //             if (isLast) {
        //                 res.push(cur)
        //             } else {
        //                 fn(itemIndex + 1, cur)
        //             }
        //         }
        //     }
        //     fn(0, [])
        //     return res
        // }
        console.log(combine(all));

    </script>
</body>

</html>

查看全文

相关阅读:
2-SAT模板
 AC自动机
 省选预备营-Day3（图论）总结
 省选预备营-Day2（分治）总结
 左偏树（可并堆）总结
 省选预备营-Day1（数据结构）总结
 OI基础知识
 C++ 堆
 CH4601 普通平衡树
 java 函数形参传值和传引用的区别

原文地址：https://www.cnblogs.com/samsara-yx/p/13223554.html