LeetCode-416. Partition Equal Subset Sum

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

zy2317878

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

阅读量167

点赞数

分类专栏： LeetCode 文章标签： LeetCode Dynamic Programming

本文链接：https://blog.csdn.net/zy2317878/article/details/80942366

版权

LeetCode 专栏收录该内容

254 篇文章 3 订阅

订阅专栏

Description

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

1.Each of the array element will not exceed 100.
2.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.

Solution 1(C++)

class Solution {
public:
    bool canPartition(vector<int>& nums) {
        int sum = 0;
        for(int n:nums){
            sum += n;
        }
        if(sum%2 != 0) return false;
        else return helper(nums, sum/2);
    }

private:
    bool helper(vector<int>& nums, int target){
        vector<bool> dp(target+1, false);
        dp[0] = true;
        for(int i=0; i<nums.size(); i++){
            for(int j=target; j>=nums[i]; j--){
                dp[j] = dp[j] || dp[j-nums[i]];
            }
        }
        return dp[target];
    }