Day 43 | 1049. Last Stone Weight II | 494. Target Sum | 474. Ones and Zeroes

王锴KKKKKKyle

已于 2023-08-16 23:22:02 修改

阅读量664

点赞数

分类专栏： LeetCode 文章标签： java leetcode

于 2023-06-12 17:48:18 首次发布

本文链接：https://blog.csdn.net/kyle313606922/article/details/131152206

版权

LeetCode 专栏收录该内容

52 篇文章 0 订阅

订阅专栏

1049. Last Stone Weight II

Question Link

class Solution {
    public int lastStoneWeightII(int[] stones) {
        if(stones == null || stones.length == 0)
            return 0;
        int sum = 0;
        for(int stone : stones)
            sum += stone;

        int target = sum / 2;
        int[] dp = new int[target+1];
        for(int i = 0; i < stones.length; i++){
            for(int j = target; j >= stones[i]; j--)
                dp[j] = Math.max(dp[j], dp[j - stones[i]] + stones[i]);
        }
        return sum - 2 * dp[target];
    }
}

Divide the stones into two piles of equal weight as much as possible. The stone remaining after the collision is the smallest.
For instance, when input [2,4,1,1], target = (2 + 4 + 1 + 1)/2 = 4, status of 2D array:

	1	2	3	4
stones[0]	0	2	2	2
stones[1]	0	2	2	4
stones[2]	1	2	3	4
stones[3]	1	2	3	4

494. Target Sum

Question Link

class Solution {
    public int findTargetSumWays(int[] nums, int target) {
        int sum = 0;
        for(int num : nums)
            sum += num;
        if((sum + target)%2 != 0) return 0;
        if(target < 0 && -target > sum) return 0;

        int bagSize = (sum+target) / 2;
        int[] dp = new int[bagSize + 1];
        dp[0] = 1;

        for(int i = 0; i < nums.length; i++){
            for(int j = bagSize; j >= nums[i]; j--){
                dp[j] = dp[j] + dp[j - nums[i]];
            }
        }
        return dp[bagSize];
    }
}

Divide the nums in to an addition set left and a subtraction set right, then we can make the following derivation:
- left + right = sum
- left - right = target
- left - sum + left = target
- left = (target + sum) / 2
If sum + target can not be divided exactly by 2, which means that is problem has no solution.
Status change of 2D array：

	0	1	2	3	4
nums[0]	1	1	0	0	0
nums[1]	1	2	1	0	0
nums[2]	1	3	3	1	0
nums[3]	1	4	6	4	1
nums[4]	1	5	10	10	0

474. Ones and Zeroes

Question Link

class Solution {
    public int findMaxForm(String[] strs, int m, int n) {
        int[][] dp = new int[m+1][n+1];
        int oneNum, zeroNum;
        for(String str : strs){
            oneNum = 0;
            zeroNum = 0;
            for(char ch : str.toCharArray()){
                if(ch == '0')
                    zeroNum++;
                else
                    oneNum++;
            }
            // Reverse order traversal
            for(int i = m; i >= zeroNum; i--){
                for(int j = n; j >= oneNum ; j--)
                    dp[i][j] = Math.max(dp[i][j], dp[i - zeroNum][j - oneNum] + 1);
            }
        }
        return dp[m][n];
    }
}

dp[i][j]：The length of the largest subset of strs with at most i number of 0 and j number of 1
- Recursion formula: dp[i][j] = max(dp[i][j], dp[i - zeroNum][j - oneNum] + 1).
- Compare to the previous recursion formula, zeroNum and oneNum of the string are equivalent to the weight[i], the number of strings themselves corresponds to the value[i].
The elements of strs are the items in the bag, m and n correspond to the bag capacity.

王锴KKKKKKyle

关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
Day 43 | 1049. Last Stone Weight II | 494. Target Sum | 474. Ones and Zeroes

Day 43 | 1049. Last Stone Weight II | 494. Target Sum | 474. Ones and Zeroes |
复制链接

扫一扫