416. Partition Equal Subset Sum
2017-12-18 00:20
375 查看
Partition Equal Subset Sum
就是把一个正数数组分成两个值相等的子集,从这里来看整个数组的值必须是偶数,分成的子集的和就是整个数组的和的一半,所以这就是最终的子集值的目标,这样就可以归类为一个动态规划的问题,定一个数组flag[i],其中i的意思是数字i可以用数个子集来构成值,所以
flag[i] = flag[i] || flag[i - nums[j],这样就得到了转移方程。
class Solution { public: bool canPartition(vector<int>& nums) { int sum =accumulate(nums.begin(), nums.end(), 0); if(sum % 2 == 1) return false; int target = sum / 2; vector<bool> flag(target + 1, false); flag[0] = true; for (int i = 0; i < nums.size(); i++) { for (int j = target; j >= nums[i]; j--) { flag[j] = flag[j] || flag[j - nums[i]]; } } return flag[target]; } };
相关文章推荐
- 416. Partition Equal Subset Sum
- leetcode-416-Partition Equal Subset Sum
- 416. Partition Equal Subset Sum
- 416. Partition Equal Subset Sum
- 416. Partition Equal Subset Sum
- 416. Partition Equal Subset Sum
- 416. Partition Equal Subset Sum
- 416. Partition Equal Subset Sum
- 【Leetcode】416-Partition Equal Subset Sum -- javascript解法 01背包问题
- LeetCode - 416 - Partition Equal Subset Sum
- 416. Partition Equal Subset Sum
- 416. Partition Equal Subset Sum
- 416. Partition Equal Subset Sum
- 416. Partition Equal Subset Sum
- 算法分析与设计第十一周:416. Partition Equal Subset Sum
- leetcode 416 Partition Equal Subset Sum 对半分
- 416. Partition Equal Subset Sum
- [Leetcode] #416 Partition Equal Subset Sum
- 416. Partition Equal Subset Sum
- [LeetCode] 416 Partition Equal Subset Sum