[LeetCode]Partition Equal Subset Sum@Python

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

Goofiness

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

阅读量142

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode dynamic programming 文章标签： leetcode python

本文链接：https://blog.youkuaiyun.com/byr_wy/article/details/97110944

leetcode 同时被 2 个专栏收录

232 篇文章

订阅专栏

dynamic programming

43 篇文章

订阅专栏

本文探讨了如何判断一个正整数数组是否可以被分为两个子集，使得两个子集的元素之和相等。通过使用Python实现解决方案，我们提供了一个具体的例子来说明这一过程。

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

Partition Equal Subset Sum

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

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

Solution

class Solution:
    def canPartition(self, nums: List[int]) -> bool:
        if sum(nums)&1 == 0:
            target = sum(nums)>>1
            cur = {0}
            for n in nums:
                cur |= {n + x for x in cur}
                if target in cur:
                    return True
        return False