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.
54 lines
1.3 KiB
54 lines
1.3 KiB
/**
|
|
* File: permutations_ii.dart
|
|
* Created Time: 2023-08-10
|
|
* Author: liuyuxin (gvenusleo@gmail.com)
|
|
*/
|
|
|
|
/* 回溯演算法：全排列 II */
|
|
void backtrack(
|
|
List<int> state,
|
|
List<int> choices,
|
|
List<bool> selected,
|
|
List<List<int>> res,
|
|
) {
|
|
// 當狀態長度等於元素數量時，記錄解
|
|
if (state.length == choices.length) {
|
|
res.add(List.from(state));
|
|
return;
|
|
}
|
|
// 走訪所有選擇
|
|
Set<int> duplicated = {};
|
|
for (int i = 0; i < choices.length; i++) {
|
|
int choice = choices[i];
|
|
// 剪枝：不允許重複選擇元素 且 不允許重複選擇相等元素
|
|
if (!selected[i] && !duplicated.contains(choice)) {
|
|
// 嘗試：做出選擇，更新狀態
|
|
duplicated.add(choice); // 記錄選擇過的元素值
|
|
selected[i] = true;
|
|
state.add(choice);
|
|
// 進行下一輪選擇
|
|
backtrack(state, choices, selected, res);
|
|
// 回退：撤銷選擇，恢復到之前的狀態
|
|
selected[i] = false;
|
|
state.removeLast();
|
|
}
|
|
}
|
|
}
|
|
|
|
/* 全排列 II */
|
|
List<List<int>> permutationsII(List<int> nums) {
|
|
List<List<int>> res = [];
|
|
backtrack([], nums, List.filled(nums.length, false), res);
|
|
return res;
|
|
}
|
|
|
|
/* Driver Code */
|
|
void main() {
|
|
List<int> nums = [1, 2, 2];
|
|
|
|
List<List<int>> res = permutationsII(nums);
|
|
|
|
print("輸入陣列 nums = $nums");
|
|
print("所有排列 res = $res");
|
|
}
|