491. 递增子序列
思路
主要的问题在于去重,相同的数字每一层只能出现一次,所以需要set
来去重,其余根据题目要求即可
代码
class Solution {
public:
vector<vector<int>> res;
vector<int> path;
vector<vector<int>> findSubsequences(vector<int>& nums) {
backtracking(nums, 0);
return res;
}
void backtracking(vector<int>& nums, int startIndex){
// if (startIndex > nums.size()) return;
if (path.size() >= 2){
res.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();
}
}
};
46. 全排列
思路
全排列,需要一个used
数组来看是否重复使用过
代码
class Solution {
public:
vector<vector<int>> res;
vector<int> path;
vector<vector<int>> permute(vector<int>& nums) {
vector<bool> used(nums.size(), false);
backtracking(nums, used);
return res;
}
void backtracking(vector<int>& nums, vector<bool> used){
if (path.size() == nums.size()){
res.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);
used[i] = false;
path.pop_back();
}
}
};
47. 全排列 II
思路
一个是会有重复数字,所以每一层的化需要一个set
来去除重复数字
还有就是全排列,需要一个used
数组来看是否重复使用过
代码
class Solution {
public:
vector<vector<int>> res;
vector<int> path;
vector<vector<int>> permuteUnique(vector<int>& nums) {
sort(nums.begin(), nums.end());
vector<bool> used(nums.size(), false);
backtracking(nums, used);
return res;
}
void backtracking(vector<int>& nums, vector<bool> used){
if (path.size() == nums.size()){
res.push_back(path);
return;
}
unordered_set<int> uset;
for (int i = 0; i < nums.size(); i ++){
if (used[i] == true || uset.find(nums[i]) != uset.end()) continue;
path.push_back(nums[i]);
used[i] = true;
uset.insert(nums[i]);
backtracking(nums, used);
path.pop_back();
used[i] = false;
}
}
};