class Solution {
private:
vector<vector<int>> result;
vector<int>path;
void backtracking(vector<int>& nums, int index){
if(path.size() > 1){
result.push_back(path);
}
unordered_set<int> uset;
for (int i = index; 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) {
result.clear();
path.clear();
backtracking(nums,0);
return result;
}
};
力扣-491.递增子序列
最新推荐文章于 2024-10-04 14:10:29 发布