mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 11:43:12 +08:00
27 lines
856 B
HTML
27 lines
856 B
HTML
<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> </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> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= nums.length <= 200</code></li>
|
|
<li><code>1 <= nums[i] <= 100</code></li>
|
|
</ul>
|