对数组全排列算法的记录-CSDN博客

本文链接：https://blog.csdn.net/weixin_50902154/article/details/123919520

本文探讨了使用递归算法实现数组的全排列以及多个属性的组合。通过`constpermute`函数展示了如何生成给定数组的所有可能排列，而`combine`函数则用于将多个数组的元素进行所有可能的组合。这些算法在解决组合问题和数据操作中具有广泛应用。

摘要由CSDN通过智能技术生成

const permute = function (nums) {
            let results = [];
            let go = (current) => {
                if (current.length === nums.length) {
                    results.push(current);
                }
                nums.forEach(n => {
                    if (!current.includes(n)) {
                        go([...current, n]);
                    }
                });
            }
            go([]);
            return results;
        };
        // console.log(permute([1, 2, 3]));

上面是基础版本，下面为进阶

        let names = ["iPhone X", "iPhone XS"]
        let colors = ["黑色", "白色"]
        let storages = ["64g", "256g"]

        let combine = function (...chunks) {
            let res = []

            let helper = function (chunkIndex, prev) {
                let chunk = chunks[chunkIndex]
                let isLast = chunkIndex === chunks.length - 1
                for (let val of chunk) {
                    let cur = prev.concat(val)
                    if (isLast) {
                        // 如果已经处理到数组的最后一项了 则把拼接的结果放入返回值中
                        res.push(cur)
                    } else {
                        helper(chunkIndex + 1, cur)
                    }
                }
            }
            // 从属性数组下标为 0 开始处理
            helper(0, [])
            return res
        }
        // console.log(combine(names, colors, storages))

典型题目

var letterCombinations = function(digits) {
   if(digits.length==0){
        return []
    }
    let map={
        2: ['a','b','c'],
        3: ['d','e','f'],
        4: ['g','h','i'],
        5: ['j','k','l'],
        6: ['m','n','o'],
        7: ['p','q','r','s'],
        8: ['t','u','v'],
        9: ['w','x','y','z'],
    }
    let go=(path,cur,res)=>{
        if(cur === digits.length){
            res.push(path.join(''));
            return;
        }
        let temp=map[digits[cur]];
        temp.forEach((item,index)=>{
            path.push(item);
            go(path,cur+1,res);
            path.pop();
        })
        return res;
    }
    return go([],0,[])
};