代码随想录42|1049. 最后一块石头的重量 II、494. 目标和、474. 一和零

1049. 最后一块石头的重量 II - 力扣（Leetcode）

class Solution {
public:
    int lastStoneWeightII(vector<int>& stones) {
        int sum = 0;
        for(int stone : stones) 
            sum += stone;
        bool odd_num = ((sum & 1) == 1);
        sum /= 2;
        int min_gap = sum - stones[0] >= 0 ? sum - stones[0] : sum;
        vector<int> dp(sum + 1, 0);
        for(vector<int>::size_type i = stones[0]; i < dp.size(); i++) 
            dp[i] = stones[0];
        for(vector<int>::size_type i = 1; i < stones.size(); i++) {
            for(vector<int>::size_type j = dp.size() - 1; j >= stones[i]; j--) {
                dp[j] = max(dp[j], dp[j - stones[i]] + stones[i]);
                min_gap = min(min_gap, sum - dp[j]);
                if(min_gap == 0) return odd_num;
            }
        }
        return min_gap * 2 + odd_num;
    }
};

494. 目标和 - 力扣（Leetcode）

class Solution {
public:
    int findTargetSumWays(vector<int>& nums, int target) {
        int sum = 0;
        target = abs(target);
        for(int num : nums) {
            num = abs(num);
            sum += num;
        }
        sum = sum + target;
        if((sum & 1) == 1) return 0;
        sum = sum >> 1;
        vector<int> dp(1001 , 0);
        dp[0] = 1 + (nums[0] == 0);
        dp[nums[0]] = 1 + (nums[0] == 0);
        for(vector<int>::size_type i = 1; i < nums.size(); i++) {
            for(int j = dp.size() - 1; j >= nums[i]  && j >= 0; j--) {
                dp[j] = dp[j] + dp[j - nums[i]];
            }
        }
        return dp[sum];
    }
};

474. 一和零 - 力扣（Leetcode）

class Solution {
public:
    int findMaxForm(vector<string>& strs, int m, int n) {
        vector< vector<int> > dp(m + 1, vector<int>(n + 1, 0));
        for(string s : strs) {
            string::size_type ones = 0, zeros = 0;
            for(char c : s) {
                if(c == '1') ones++;
                else zeros++;
            }
            for(int i = m; i >= 0 && i >= zeros; i--) {
                for(int j = n; j >= 0 && j >= ones; j--) {
                    dp[i][j] = max(dp[i][j], dp[i - zeros][j - ones] + 1);
                }
            }
        }
        return dp[m][n];
   }
};