因为数据有重复所以回溯法会给出重复的结果,需要set去重复。
class Solution {
public:
/**
* @param nums: an integer array
* @return: all the different possible increasing subsequences of the given array
*/
set<vector<int>> judge;
vector<vector<int>> globalans;
vector<vector<int>> findSubsequences(vector<int> &nums) {
// Write your code here
vector<int> res;
dfs(res,nums,0);
return globalans;
}
void dfs(vector<int> &res,vector<int>&nums,int p){
if(res.size()>=2){
if(judge.find(res)==judge.end()){
judge.insert(res);
globalans.push_back(res);
}
}
if(res.size()==0){
for(int i=p;i<nums.size();i++){
res.push_back(nums[i]);
dfs(res,nums,i+1);
res.pop_back();
}
return;
}
for(int i=p;i<nums.size();i++){
if(res[res.size()-1]<=nums[i]){
res.push_back(nums[i]);
dfs(res,nums,i+1);
res.pop_back();
}
}
}
};