You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
43 lines
1.1 KiB
43 lines
1.1 KiB
8 months ago
|
/**
|
||
|
* File: permutations_i.js
|
||
|
* Created Time: 2023-05-13
|
||
|
* Author: Justin (xiefahit@gmail.com)
|
||
|
*/
|
||
|
|
||
|
/* 回溯演算法:全排列 I */
|
||
|
function backtrack(state, choices, selected, res) {
|
||
|
// 當狀態長度等於元素數量時,記錄解
|
||
|
if (state.length === choices.length) {
|
||
|
res.push([...state]);
|
||
|
return;
|
||
|
}
|
||
|
// 走訪所有選擇
|
||
|
choices.forEach((choice, i) => {
|
||
|
// 剪枝:不允許重複選擇元素
|
||
|
if (!selected[i]) {
|
||
|
// 嘗試:做出選擇,更新狀態
|
||
|
selected[i] = true;
|
||
|
state.push(choice);
|
||
|
// 進行下一輪選擇
|
||
|
backtrack(state, choices, selected, res);
|
||
|
// 回退:撤銷選擇,恢復到之前的狀態
|
||
|
selected[i] = false;
|
||
|
state.pop();
|
||
|
}
|
||
|
});
|
||
|
}
|
||
|
|
||
|
/* 全排列 I */
|
||
|
function permutationsI(nums) {
|
||
|
const res = [];
|
||
|
backtrack([], nums, Array(nums.length).fill(false), res);
|
||
|
return res;
|
||
|
}
|
||
|
|
||
|
// Driver Code
|
||
|
const nums = [1, 2, 3];
|
||
|
const res = permutationsI(nums);
|
||
|
|
||
|
console.log(`輸入陣列 nums = ${JSON.stringify(nums)}`);
|
||
|
console.log(`所有排列 res = ${JSON.stringify(res)}`);
|