第一题是递增子序列https://leetcode.cn/problems/non-decreasing-subsequences/,从数组中选取递增数列,与上一题子集问题类似,都是要在每个节点中取到自己的结果。但要注意到该问题中数组并不能排序处理,本题要求是要递增子序列,排序后就没意义了。本题中的去重操作也要注意,利用hash方法确定元素是否被重复使用。
class Solution {
public:
vector<int> path;
vector<vector<int>> result;
void backtracking(vector<int>& nums, int startindex){
if (path.size() > 1) result.push_back(path);
unordered_set<int> uset;
for (int i = startindex; i < nums.size(); i++){
if ((!path.empty() && nums[i] < path.back()) || uset.find(nums[i]) != uset.end()) continue;
uset.insert(nums[i]);
path.push_back(nums[i]);
backtracking(nums, i + 1);
path.pop_back();
}
return;
}
vector<vector<int>> findSubsequences(vector<int>& nums) {
backtracking(nums, 0);
return result;
}
};
还有一种去重方式,即使用数组方法,效率更高。
class Solution {
public:
vector<int> path;
vector<vector<int>> result;
void backtracking(vector<int>& nums, int startindex){
if (path.size() > 1) result.push_back(path);
int uset[201] = {0};
for (int i = startindex; i < nums.size(); i++){
if ((!path.empty() && nums[i] < path.back()) || uset[nums[i] + 100] == 1) continue;
uset[nums[i] + 100] = 1;
path.push_back(nums[i]);
backtracking(nums, i + 1);
path.pop_back();
}
return;
}
vector<vector<int>> findSubsequences(vector<int>& nums) {
backtracking(nums, 0);
return result;
}
};
第二题是全排列https://leetcode.cn/problems/permutations/description/,正式从组合问题进入排列问题。与组合问题不同的是,我们无需再考虑树层去重,只需在同一树枝上对已使用元素进行标记即可。
class Solution {
public:
vector<vector<int>> result;
vector<int> path;
void backtracking(vector<int>& nums, vector<bool> used){
if (path.size() == nums.size()){//排列需要满足不遗漏元素
result.push_back(path);
return;
}
for (int i = 0; i < nums.size(); i++){
if (used[i] == true) continue;//已使用过该元素
path.push_back(nums[i]);
used[i] = true;
backtracking(nums, used);
path.pop_back();
used[i] = false;
}
}
vector<vector<int>> permute(vector<int>& nums) {
vector<bool> used(nums.size(), false);
backtracking(nums, used);
return result;
}
};
第三题是全排列的延伸https://leetcode.cn/problems/permutations-ii/submissions/501323835/,要求在存在重复元素的数组中求出所有不重复的排列。需要灵活运用树枝去重与树层去重。
class Solution {
public:
vector<vector<int>> result;
vector<int> path;
void backtracking(vector<int>& nums, vector<bool> used){
if (path.size() == nums.size()) {
result.push_back(path);
return;
}
for (int i = 0; i < nums.size(); i++){
if (i > 0 && nums[i - 1] == nums[i] && used[i - 1] == false) continue;//树层去重
if (used[i] == true) continue;//树枝去重
path.push_back(nums[i]);
used[i] = true;
backtracking(nums, used);
path.pop_back();
used[i] = false;
}
}
vector<vector<int>> permuteUnique(vector<int>& nums) {
sort(nums.begin(), nums.end());
vector<bool> used(nums.size(), false);
backtracking(nums, used);
return result;
}
};