<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(std::vector<int>& nums) {
        auto total = std::accumulate(nums.begin(), nums.end(), 0);
        if (total & 1) return false;
        auto target = total / 2 + 1;
        auto n = nums.size() + 1;
        std::vector<std::vector<uint8_t>> dp;
        dp.reserve(target);
        dp.emplace_back(std::vector<uint8_t>(n, 1));
        for (auto i = 1; i < target; ++i) {
            auto& line = dp.emplace_back(std::vector<uint8_t>(n));
            for (int j = 1; j < n; ++j) {
                if (auto id = i - nums[j - 1]; id >= 0 && dp[id][j - 1]) {
                    fill_n(line.begin() + j, n - j, 1);
                    break;
                }
            }
        }
        return dp.back().back();
    }
};
50760