算法随想录算法训练营第三十六天|416. 分割等和子集

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