Open Genzhen opened 3 years ago
const permute = function (nums) {
const res = []
const used = {}
const recursion = (path) => {
if (path.length <= nums.length) {
res.push(path)
} else {
return
}
for (const value of nums) {
if (used[value]) {
continue
}
used[value] = true
recursion([...path, value])
used[value] = false
}
}
recursion([])
return res
};
扫描下方二维码,收藏关注,及时获取答案以及详细解析,同时可解锁800+道前端面试题。