[leetcode]416.C++实现 分割等和子集(Partition Equal Subset Sum)

1.题目描述

2题目分析

dp[i][j] = dp[i - 1][j] || dp[i - 1][j - nums[i]];

3.代码实现

class Solution {
public:
    bool canPartition(vector<int>& nums) {
	bool res = false;
	int sum = 0;
	int m = nums.size();
	for (int i = 0; i < m; i++) {
		sum += nums[i];
	}
	if ((sum & 1) == 1) {
		return false;
	}
	sum /= 2;
	bool *dp = new bool [sum + 1];
	for (int i = 1; i <= sum; i++) {
		dp[i] =false;
	}
	dp[0] = true;
 
	for (int i = 0; i < m; i++) {
		for (int j = sum; j > 0; j--) {
			if (j >= nums[i]) {
				dp[j] =dp[j] || dp[j - nums[i]];
			}
		}
	}
	res = dp[sum];
 
	delete[] dp;
	return res; 
    }
};