<p>Given a <strong>non-empty</strong> array <code>nums</code> containing <strong>only positive integers</strong>, find if the array can be partitioned into two subsets such that the sum of elements in both subsets is equal.</p> <p> </p> <p><strong>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>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>