class Solution {
public:
vector<vector<int>>result;
vector<int>path;
void backtracing(vector<int>& nums,int start)
{
if(path.size()>1)
result.push_back(path);
unordered_set<int>used;
for(int i=start;i<nums.size();i++)
{
if(!path.empty()&&nums[i]<path.back()||used.find(nums[i])!=used.end())
continue;
path.push_back(nums[i]);
used.insert(nums[i]);
backtracing(nums,i+1);
path.pop_back();
}
}
vector<vector<int>> findSubsequences(vector<int>& nums) {
backtracing(nums,0);
return result;
}
};
class Solution {
public:
vector<vector<int>>result;
vector<int>path;
void backtracing(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]);
backtracing(nums,used);
path.pop_back();
used[i]=false;
}
}
vector<vector<int>> permute(vector<int>& nums) {
vector<bool>used(nums.size(),false);
backtracing(nums,used);
return result;
}
};
class Solution {
public:
vector<vector<int>>result;
vector<int>path;
void backtracing(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]==true)
continue;
if(used[i]==false)
{
used[i]=true;
path.push_back(nums[i]);
backtracing(nums,used);
path.pop_back();
used[i]=false;
}
}
}
vector<vector<int>> permuteUnique(vector<int>& nums) {
vector<bool>used(nums.size(),false);
sort(nums.begin(),nums.end());
backtracing(nums,used);
return result;
}
};