首页 > 其他 > 详细

LeetCode 416. Partition Equal Subset Sum

时间:2018-12-04 21:43:07      阅读:108      评论:0      收藏:0      [点我收藏+]

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.

分析

这道题用动态规划,dp[i] 表示是否能从数组中取得数字之和为i , 动态转移方程dp[i]=dp[i]||dp[i-n] .

class Solution {
public:
    bool canPartition(vector<int>& nums) {
         int s=accumulate(nums.begin(),nums.end(),0);
         if(s%2!=0) return false;
         vector<int> dp(s/2+1,0);
         dp[0]=1;
         vector<int> visited(s/2+1,0);
         for(auto o:nums)
             for(int i=s/2;i>=o;i--)
                 dp[i]=dp[i-o]||dp[i];
         return dp[s/2]==1;
    }
};

LeetCode 416. Partition Equal Subset Sum

原文:https://www.cnblogs.com/A-Little-Nut/p/10066934.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!