LeetCode: Partition Equal Subset Sum

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

yyfly22

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

阅读量282

点赞数 1

CC 4.0 BY-SA版权

分类专栏： LeetCode 文章标签： dynamic programming LeetCode c语言 subset sum

本文链接：https://blog.youkuaiyun.com/u012309913/article/details/54951117

LeetCode 专栏收录该内容

71 篇文章

订阅专栏

本文探讨了一个经典的计算机科学问题：给定一个仅包含正整数的非空数组，判断该数组是否可以划分为两个子集，使得这两个子集的元素之和相等。文中提供了具体的算法实现，并通过两个示例进行了说明。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

int subsetSum(int* nums, int numsSize, int s) {
    int* dp = (int*)malloc((s + 1) * sizeof(int));
    for (int i = 0; i <= s; ++i) {
        dp[i] = 0;
    }
    dp[0] = 1;
    
    for (int n = 0; n < numsSize; ++n) {
        for (int i = s; i >= nums[n]; --i) {
            dp[i] += dp[i - nums[n]]; 
        }
        
        if (dp[s] > 0) {
            return dp[s];
        }
    }
    
    return dp[s];
}

bool canPartition(int* nums, int numsSize) {
    int sum = 0;
    for (int i = 0; i < numsSize; ++i) {
        sum += nums[i];
    }
    
    if (sum % 2) {
        return false;
    }
    
    return subsetSum(nums, numsSize, sum / 2);
}