<p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> nums = [4,6,7,7]
<strong>Output:</strong> [[4,6],[4,6,7],[4,6,7,7],[4,7],[4,7,7],[6,7],[6,7,7],[7,7]]
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> nums = [4,4,3,2,1]
<strong>Output:</strong> [[4,4]]
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= nums.length &lt;= 15</code></li>
	<li><code>-100 &lt;= nums[i] &lt;= 100</code></li>
</ul>

class Solution {
public:
    void helper(vector<vector<int>> &ans, vector<int>&v1,vector<int>nums,int idx){
        if(idx==nums.size()){
            return;
        }
        for(int i=idx;i<nums.size();i++){
            v1.push_back(nums[i]);
            helper(ans,v1,nums,i+1);
            if(find(ans.begin(),ans.end(),v1) ==ans.end()&& v1.size()>=2){
                bool flag=false;
                for(int i=0;i<v1.size()-1;i++){
                    if(v1[i]>v1[i+1]){
                        flag=true;
                        break;
                    }
                }
                if(!flag){
                    ans.push_back(v1);
                }
            }
            v1.pop_back();
        }
    }
    vector<vector<int>> findSubsequences(vector<int>& nums) {
        vector<vector<int>> ans;
        vector<int> v1;
        helper(ans,v1,nums,0);
        return ans;
    }
};
59355