<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:
    vector<vector<int>> findSubsequences(vector<int>& nums) {
        vector<vector<int>> result;
        int n = nums.size(),range = 1<<n;
        for(int i=1;i<range;i++)
        {
            if((i&(i-1))!=0)
            {
                bool choice = true;
                vector<int> temp;
                for(int j=0;j<n;j++)
                {
                    int x = n-1-j;
                    if(i&(1<<x))
                    {
                        if(temp.empty())
                        {
                            temp.push_back(nums[j]);
                        }
                        else if(temp[temp.size()-1]<=nums[j])
                        {
                            temp.push_back(nums[j]);
                        }
                        else
                        {
                            choice = false;
                            break;
                        }
                    }
                }
                if(choice)
                {
                    auto it = find(result.begin(),result.end(),temp);
                    if(it==result.end())
                    {
                        result.push_back(temp);
                    }
                }
            }
        }
        return result;
    }
};
57073