* 491.递增子序列
class Solution {
private:
vector<vector<int>>res;
vector<int>path;
void backtracking(vector<int>&nums,int start)
{
if(path.size()>1)
{
res.push_back(path);
}
unordered_set<int>uset;
for(int i=start;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();
}
}
public:
vector<vector<int>> findSubsequences(vector<int>& nums)
{
res.clear();
path.clear();
backtracking(nums,0);
return res;
}
};
* 46.全排列
https://programmercarl.com/0046.%E5%85%A8%E6%8E%92%E5%88%97.html
46. 全排列
class Solution {
private:
vector<vector<int>>res;
vector<int>path;
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;
used[i]=true;
path.push_back(nums[i]);
backtracking(nums,used);
path.pop_back();
used[i]=false;
}
}
public:
vector<vector<int>> permute(vector<int>& nums)
{
res.clear();
path.clear();
vector<bool>used(nums.size(),false);
backtracking(nums,used);
return res;
}
};
* 47.全排列 II
47. 全排列 II
class Solution {
private:
vector<vector<int>>res;
vector<int>path;
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(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);
path.pop_back();
used[i]=false;
}
}
}
public:
vector<vector<int>> permuteUnique(vector<int>& nums)
{
res.clear();
path.clear();
sort(nums.begin(),nums.end());
vector<bool>used(nums.size(),false);
backtracking(nums,used);
return res;
}
};