题目:
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.
思路:
这道题目初始看起来比较难,但是稍微转换一下,就可以变为0-1背包问题,从而可以用动态规划的方法顺利解决。判断数组中的元素是否可以被分成和相等的两个子集,等同于求子集中的元素是否可以构成和为sum / 2的子集。我们定义dp[j]表示数组中的元素是否可以构成和为j的子集,则状态转移方程为dp[j] = {|| dp[j - num]}, for all num in nums。这种定义方式可以将空间复杂度降低到O(sum/2)。时间复杂度是O(n * sum),其中n是数组中元素的个数,sum是数组中元素的和。
代码:
class Solution {
public:
bool canPartition(vector<int>& nums) {
int sum = accumulate(nums.begin(), nums.end(), 0);
if(sum % 2 != 0) {
return false;
}
sum /= 2;
vector<bool> dp(sum + 1, false);
dp[0] = true;
for(int i = 0; i < nums.size(); ++i) {
for(int j = sum; j >= nums[i]; --j) {
dp[j] = dp[j] || dp[j - nums[i]];
}
}
return dp[sum];
}
};