491.递增子序列
- 不能排序
- 在路径上的每个节点收集结果加一个逻辑收集
- set去重,但是是函数内的变量,每层一个新的set
class Solution {
public:
vector<vector<int>> result;
vector<int> path;
void backtracking(vector<int>& nums, int startIdex) {
if (path.size()>1) result.push_back(path);
unordered_set<int> uset;
for (int i = startIdex; i < nums.size(); ++i) {
if ( (!path.empty() && nums[i] < path.back())
|| uset.find(nums[i]) != uset.end() )
continue;
path.push_back(nums[i]);
uset.insert(nums[i]);
backtracking(nums,i+1);
path.pop_back();
}
}
vector<vector<int>> findSubsequences(vector<int>& nums) {
backtracking(nums,0);
return result;
}
};
46.全排列
- used去重,不需要index了,每次重新从第一个开始,选过的不要
- 收集叶子节点
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] == false) {
path.push_back(nums[i]);
used[i] = true;
backtracking(nums,used);
path.pop_back();
used[i] = false;
} else continue;
}
}
vector<vector<int>> permute(vector<int>& nums) {
vector<bool> used(nums.size(),false);
backtracking(nums,used);
return result;
}
};
47.全排列 II
- 上一题基础上加树层去重,used两用,既用来在排除纵向递归上的单个选过的,又用来排除横向for选过的
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] == false) {
path.push_back(nums[i]);
used[i] = true;
backtracking(nums,used);
path.pop_back();
used[i] = false;
} else continue;
}
}
vector<vector<int>> permute(vector<int>& nums) {
vector<bool> used(nums.size(),false);
backtracking(nums,used);
return result;
}
};