1class Solution {2    public boolean canPartition(int[] nums) {3        int total = 0;4        for (int x : nums) total += x;5        if (total % 2 != 0) return false;6        int target = total / 2;7        boolean[] dp = new boolean[target + 1];8        dp[0] = true;9        for (int x : nums) {10            for (int sum = target; sum >= x; sum--) {11                dp[sum] = dp[sum] || dp[sum - x];12            }13        }14        return dp[target];15    }16}