力扣 491.递增子序列
题目链接:491. 递增子序列 - 力扣(LeetCode)
思路:unordered_set<int> uset;
是记录本层元素是否重复使用,新的一层uset都会重新定义(清空),所以要知道uset只负责本层!
C++代码:
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> usedset;
for(int i=startindex;i<nums.size();i++){
if(!path.empty() && nums[i]<path.back() || usedset.find(nums[i])!=usedset.end())
continue;
usedset.insert(nums[i]);
path.push_back(nums[i]);
backtracking(nums,i+1);
path.pop_back();
}
}
vector<vector<int>> findSubsequences(vector<int>& nums) {
backtracking(nums,0);
return result;
}
};
力扣 46.全排列
题目链接:46. 全排列 - 力扣(LeetCode)
思路:需要考虑顺序
C++代码:
class Solution {
public:
vector<int> path;
vector<vector<int>> result;
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;
used[i]=true;
path.push_back(nums[i]);
backtracking(nums,used);
used[i]=false;
path.pop_back();
}
}
vector<vector<int>> permute(vector<int>& nums) {
vector<bool> used(nums.size(),false);
backtracking(nums,used);
return result;
}
};
力扣 47.全排列2
题目链接:47. 全排列 II - 力扣(LeetCode)
思路:
C++代码:
class Solution {
public:
vector<int> path;
vector<vector<int>> result;
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]==nums[i-1] && used[i-1]==false) continue;
if(used[i]==false){
used[i]=true;
path.push_back(nums[i]);
backtracking(nums,used);
used[i]=false;
path.pop_back();
}
}
}
vector<vector<int>> permuteUnique(vector<int>& nums) {
sort(nums.begin(),nums.end());
vector<bool> used(nums.size(),false);
backtracking(nums,used);
return result;
}
};