[自我记录]随想录刷题第三十七天 | 1049. 最后一块石头的重量 II, 494. 目标和, 474. 一和零

代码随想录算法打卡第三十七天, 新手自我记录一下刷题历程, 仅为自我打卡使用.

---

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

class Solution {
public:
    int lastStoneWeightII(vector<int>& stones) {
        if (stones.size() < 2) return stones[0];

        int sum = 0;
        for (int i = 0; i < stones.size(); ++i) {
            sum += stones[i];
        }
        int target = sum / 2;
        vector<int> dp(target + 1, 0);
        for (int i = 0; i < stones.size(); ++i) {
            for (int j = target; j >= stones[i]; --j) {
                dp[j] = max(dp[j], dp[j - stones[i]] + stones[i]);
            }
        }

        return sum - dp[target] - dp[target];
    }
};

---

494. 目标和

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

        for (int i = 0; i < nums.size(); ++i) {
            for (int j = (sum + target) / 2; j >= nums[i]; --j) {
                dp[j] += dp[j - nums[i]];
            }
        }
        return dp[(sum + target) / 2];
    }
};

---

474. 一和零

class Solution {
public:
    int findMaxForm(vector<string>& strs, int m, int n) {
        vector<vector<int>> dp(m + 1, vector<int>(n + 1, 0));
        for (int i = 0; i < strs.size(); ++i) {
            int zeroNum = 0;
            int oneNum = 0;
            for (char str: strs[i]) {
                if (str == '0') zeroNum++;
                else oneNum++;
            }
            for (int j = m; j >= zeroNum; --j) {
                for (int k = n; k >= oneNum; --k) {
                    dp[j][k] = max(dp[j - zeroNum][k - oneNum] + 1, dp[j][k]);
                }
            }
        }
        return dp[m][n];
    }
};

---

希望还能再坚持一天!