<p>Given an integer array <code>nums</code> of <strong>unique</strong> elements, return <em>all possible</em> <span data-keyword="subset"><em>subsets</em></span> <em>(the power set)</em>.</p>

<p>The solution set <strong>must not</strong> contain duplicate subsets. Return the solution in <strong>any order</strong>.</p>

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

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

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

<pre>
<strong>Input:</strong> nums = [0]
<strong>Output:</strong> [[],[0]]
</pre>

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

<ul>
	<li><code>1 &lt;= nums.length &lt;= 10</code></li>
	<li><code>-10 &lt;= nums[i] &lt;= 10</code></li>
	<li>All the numbers of&nbsp;<code>nums</code> are <strong>unique</strong>.</li>
</ul>

class Solution {
public:
    void generatePowerSet(vector<int>& nums, vector<int>& currentSet, int index,
                          vector<vector<int>>& powerSet) {
        if (index == nums.size()) {
            powerSet.push_back(currentSet);
            return;
        }
        generatePowerSet(nums, currentSet, index + 1, powerSet);
        currentSet.push_back(nums[index]);
        generatePowerSet(nums, currentSet, index + 1, powerSet);
        currentSet.pop_back();
    }
    vector<vector<int>> getPowerSet(vector<int>& nums) {
        vector<vector<int>> powerSet;
        vector<int> currentSet;
        generatePowerSet(nums, currentSet, 0, powerSet);
        return powerSet;
    }

    vector<vector<int>> subsets(vector<int>& nums) {
        vector<vector<int>> ans;
        set<vector<int>>withoutDup;
        vector<vector<int>> setOfVectors=getPowerSet(nums);
        for(auto vec : setOfVectors){
            sort(vec.begin(),vec.end());
            withoutDup.insert(vec);
        }
        for(set<vector<int>>::iterator it = withoutDup.begin(); it != withoutDup.end(); it++){
            ans.push_back(*it);
        }

        return ans;
    }
};
11900