← 返回 bloomberg 的题目列表Partition Equal Subset Sum
类型:online_judge
Given an array of integers, determine if it can be partitioned into two subsets with equal sum. We require a complete algorithm description, test cases, and data scale.
Example
Input
[1, 5, 11, 5]