Partition Equal Subset Sum
A.题意
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.
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.
大概的题意就是给你一个数组的数字,问能不能分成两个子数组使得两个子数组中的所有元素之和相等。
B.思路
这道题一开始拿到我也不知道大概怎么做才能做到和一样地分开,后来开到是分成两半我才想到可以把总和除以二来做,于是问题转换为这个数组中的数字能不能只用一次加出所有和的一半,能否加出目标和上课过程做过类似的例子,这里动态规划递归方程如下
dp[j] = dp[j] || dp[j - nums[i]];
C.代码实现
class Solution {
public:
bool canPartition(vector<int>& nums) {
int sum = accumulate(nums.begin(), nums.end(), 0);
if (sum % 2 != 0) return false;
int target = sum / 2;
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];
}
};