【LeetCode】 416. Partition Equal Subset Sum

最新推荐文章于 2024-09-09 14:10:45 发布

LSF_Kevin

最新推荐文章于 2024-09-09 14:10:45 发布

阅读量266

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/qq_31129455/article/details/54578050

版权

LeetCode 专栏收录该内容

217 篇文章 0 订阅

订阅专栏

Given a non-empty array containing only positive integers, find if the array can be partitioned into two subsets such that the sum of elements in both subsets is equal.

Note:

Each of the array element will not exceed 100.
The array size will not exceed 200.

Example 1:

Input: [1, 5, 11, 5]

Output: true

Explanation: The array can be partitioned as [1, 5, 5] and [11].

Example 2:

Input: [1, 2, 3, 5]

Output: false

Explanation: The array cannot be partitioned into equal sum subsets.

public class Solution {
    public boolean canPartition(int[] nums) {
        int sum = 0;
        for (int num : nums) {
            sum += num;
        }
        if (sum % 2 == 1) {
            return false;
        }
        sum /= 2;
        boolean[] dp = new boolean[sum + 1];
        dp[0] = true;
        for (int i = 0; i < nums.length; i++) {
            for (int j = sum; j >= nums[i]; j--) {
                dp[j] = dp[j] || dp[j - nums[i]];
            }
        }
        return dp[sum];
    }
}