class Solution {
public:
int getSum(vector<int>& nums) {
int sum = 0;
for (auto& elem : nums) {
sum += elem;
}
return sum;
}
bool canPartition(vector<int>& nums) {
int sum = getSum(nums);
if (sum % 2 != 0 || nums.size() == 1)
return false;
int target = sum / 2;
vector<int> dp(target + 1);
//初始化
for (int j = 0; j <= target; j++) {
dp[j] = 0;
}
//遍历
for (int i = 0; i < nums.size(); i++) {
for (int j = target; j >= 0 && j >= nums[i]; j--) {
dp[j] = max(dp[j], dp[j - nums[i]] + nums[i]);
}
}
//返回
if (dp[target] == target)
return true;
return false;
}
};
LeetCode416. 分割等和子集
最新推荐文章于 2024-10-16 19:00:38 发布