491.递增子序列
代码如下:
class Solution {
private:
vector<int> path;
vector<vector<int>> ans;
void backtracking(vector<int>& nums, int startIndex) {
if (path.size() >= 2) {
ans.push_back(path);
}
unordered_set<int> used; // 用于去重,这个used在每一层开头都会自动清零
for (int i = startIndex; i < nums.size(); i++) {
if (!path.empty() && nums[i] < path.back()) { //back是返回最后一个元素
continue; // 忽略非递增的元素
}
if (used.count(nums[i])) {
continue; // 忽略重复的元素
}
path.push_back(nums[i]);
backtracking(nums, i + 1);
path.pop_back();
used.insert(nums[i]);
}
}
public:
vector<vector<int>> findSubsequences(vector<int>& nums) {
backtracking(nums, 0);
return ans;
}
};
46.全排列
代码如下:
class Solution {
private:
vector<int> path;
vector<vector<int>> ans;
void backtracking(vector<int>& nums) {
if (path.size() == nums.size()) {
ans.push_back(path);
return;
}
for (int i = 0; i < nums.size(); i++) {
if (find(path.begin(), path.end(), nums[i]) != path.end()) { //跳过已经选择的元素
continue;
}
path.push_back(nums[i]);
backtracking(nums);
path.pop_back();
}
}
public:
vector<vector<int>> permute(vector<int>& nums) {
backtracking(nums);
return ans;
}
};
47.全排列2
代码如下:
class Solution {
private:
vector<int> path;
vector<vector<int>> ans;
vector<bool> used;
void backtracking(vector<int>& nums) {
if (path.size() == nums.size()) {
ans.push_back(path);
return;
}
for (int i = 0; i < nums.size(); i++) {
if (used[i] || (i > 0 && nums[i] == nums[i - 1] && !used[i - 1])) { //这个去重步骤很关键,如果忘记了自己去看视频
continue;
}
path.push_back(nums[i]);
used[i] = true;
backtracking(nums);
path.pop_back();
used[i] = false;
}
}
public:
vector<vector<int>> permuteUnique(vector<int>& nums) {
sort(nums.begin(), nums.end());
used.assign(nums.size(), false);
backtracking(nums);
return ans;
}
};