<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:
    def __init__(self) -> None:
        self.sum = 0

    def canPartition(self, nums: List[int]) -> bool:
        self.sum = sum(nums)
        if self.sum % 2 == 1:
            return False
        nums.sort()
        
        @cache
        def _dp(sumv, i):
            if sumv == self.sum // 2:
                return True
            elif sumv > self.sum // 2:
                return False
            for j in range(i + 1, len(nums)):
                if _dp(sumv + nums[j], j):
                    return True
            return False
        return _dp(0, -1)
        
108483