Java | Leetcode Java题解之第416题分割等和子集

题目：

题解：

class Solution {public boolean canPartition(int[] nums) {int n = nums.length;if (n < 2) {return false;}int sum = 0, maxNum = 0;for (int num : nums) {sum += num;maxNum = Math.max(maxNum, num);}if (sum % 2 != 0) {return false;}int target = sum / 2;if (maxNum > target) {return false;}boolean[] dp = new boolean[target + 1];dp[0] = true;for (int i = 0; i < n; i++) {int num = nums[i];for (int j = target; j >= num; --j) {dp[j] |= dp[j - num];}}return dp[target];}
}