<p>Given an integer array <code>nums</code>, return <code>true</code> <em>if you can partition the array into two subsets such that the sum of the elements in both subsets is equal or </em><code>false</code><em> otherwise</em>.</p>

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

<pre>
<strong>Input:</strong> nums = [1,5,11,5]
<strong>Output:</strong> true
<strong>Explanation:</strong> The array can be partitioned as [1, 5, 5] and [11].
</pre>

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

<pre>
<strong>Input:</strong> nums = [1,2,3,5]
<strong>Output:</strong> false
<strong>Explanation:</strong> The array cannot be partitioned into equal sum subsets.
</pre>

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

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

class Solution {
public:
    bool canPartition(vector<int>& nums) {
        int t = 0;
        for (auto &n : nums) {
            t += n;
        }
        if (t % 2 == 1) return false;
        t = t / 2;
        unordered_set<int> us;
        queue<int> q;
        int tmp;
        for (auto &n : nums) {
            if (n == t) return true;
            q.push(n);
            for (auto &e : us) {
                tmp = e+n;
                if (tmp == t) return true;
                q.push(tmp);
            }
            while (!q.empty()) {
                us.insert(q.front());
                q.pop();
            }
        }
        return false;
    }
};
39305