今日任务
416. 分割等和子集
416. 分割等和子集
题目链接: . - 力扣(LeetCode)
class Solution {
public boolean canPartition(int[] nums) {
int sum = 0;
for (int num : nums){sum += num;}
int[] dp = new int[sum / 2 + 1];
dp[0] = 0;
if (sum % 2 == 1) return false;
for (int i = 0; i < nums.length; i++) {
for (int j = dp.length - 1; j >= nums[i]; j--) {
dp[j] = Math.max(dp[j], dp[j - nums[i]] + nums[i]);
}
if(dp[sum / 2] == sum / 2) return true;
}
return false;
}
}