491. 递增子序列(DFS)

### 解题思路

直接暴力,枚举每一种情况,注意要进行判重操作

### 代码

class Solution {
public:
    vector<vector<int>> res;
    vector<int> temp;
    void sdfs(int u,int last,vector<int>& nums){
        if(u == nums.size()){
            if(temp.size() >= 2) res.push_back(temp);
            return;
        }
        if(nums[u] >= last){
            temp.push_back(nums[u]);
            sdfs(u+1,nums[u],nums);
            temp.pop_back();
        }
        
        if(nums[u] != last){
            sdfs(u+1,last,nums);
        }
    }
    vector<vector<int>> findSubsequences(vector<int>& nums) {
        sdfs(0,INT_MIN,nums);
        return res;
    }
};