算法随想录算法训练营第三十七天| 1049. 最后一块石头的重量 II 494. 目标和 474.一和零

1049. 最后一块石头的重量 II

class Solution {
    public int lastStoneWeightII(int[] stones) {
      int len = stones.length;
        Arrays.sort(stones);
        int sum = Arrays.stream(stones).sum();
        int[][] dp = new int[len + 1][sum / 2 + 1];
        for (int i = 1; i <= len; i++) {
            for (int j = sum / 2; j > 0; j--) {
                if (j >= stones[i - 1])
                    dp[i][j] = Math.max(dp[i - 1][j], dp[i - 1][j - stones[i - 1]] + stones[i - 1]);
                else
                    dp[i][j] = dp[i - 1][j];
            }
        }
        return Math.abs(sum-2*dp[len][sum/2]);
    }
}

 494. 目标和

 public int findTargetSumWays(int[] nums, int target) {
      int sum = Arrays.stream(nums).sum();
        int num = (target + sum);
        if ((target + sum) % 2 == 1|| num<0)
            return 0;
        num = num / 2;
        int[][] dp = new int[nums.length + 1][num + 1];      
        dp[0][0] = 1;       
        for (int i = 1; i <= nums.length; i++) {
            for (int j = 0; j <= num; j++) {
                if (j >= nums[i - 1]) {
                    dp[i][j] = dp[i - 1][j] + dp[i - 1][j - nums[i - 1]];
                } else
                    dp[i][j] = dp[i - 1][j];
            }
        }
        return dp[nums.length][num];
    }