代码随想录day38 322. 零钱兑换 279.完全平方数 139.单词拆分 多重背包

代码随想录day38 322. 零钱兑换 279.完全平方数 139.单词拆分 多重背包

322. 零钱兑换

代码随想录

class Solution {
public:
    int coinChange(vector<int>& coins, int amount) {
        int len = coins.size();
        vector<int> dp(amount + 1, -1);
        dp[0] = 0;
        for (int i = 0; i < len; i++) {
            for (int j = coins[i]; j <= amount; j++) {
                if (dp[j - coins[i]] == -1) {
                    continue;
                } else if (dp[j] == -1) {
                    dp[j] = dp[j - coins[i]] + 1;
                } else {
                    dp[j] = min(dp[j], dp[j - coins[i]] + 1);
                }
            }
        }
        return dp[amount];
    }
};

class Solution {
public:
    int coinChange(vector<int>& coins, int amount) {
        vector<int> dp(amount + 1, INT_MAX);
        dp[0] = 0;
        for (int i = 0; i < coins.size(); i++) { // 遍历物品
            for (int j = coins[i]; j <= amount; j++) { // 遍历背包
                if (dp[j - coins[i]] != INT_MAX) { // 如果dp[j - coins[i]]是初始值则跳过
                    dp[j] = min(dp[j - coins[i]] + 1, dp[j]);
                }
            }
        }
        if (dp[amount] == INT_MAX) return -1;
        return dp[amount];
    }
};

279. 完全平方数

代码随想录

class Solution {
public:
    int numSquares(int n) {
        vector<int> dp(n + 1, INT_MAX);
        dp[0] = 0;
        for (int i = 1; i * i <= n; i++) {
            for (int j = i * i; j <= n; j++) {
                dp[j] = min(dp[j], dp[j - i * i] + 1);
            }
        }
        return dp[n];
    }
};

139. 单词拆分

代码随想录

class Solution {
public:
    bool wordBreak(string s, vector<string>& wordDict) {
        unordered_set<string> wordSet(wordDict.begin(), wordDict.end());
        vector<bool> dp(s.size() + 1, false);
        dp[0] = true;
        for (int i = 1; i <= s.size(); i++) {
            for (int j = 0; j < i; j++) {
                string tmp = s.substr(j, i - j);
                if (wordSet.find(tmp) != wordSet.end() && dp[j] == true) {
                    dp[i] = true;
                    break;
                }
            }
        }
        return dp[s.size()];
    }
};

多重背包

代码随想录

#include <bits/stdc++.h>
using namespace std;


int main() {
    int C, N;
    cin >> C >> N;
    vector<int> weights(N);
    vector<int> prices(N);
    vector<int> nums(N);
    for (int i = 0; i < N; i++) {
        cin >> weights[i];
    }
    for (int i = 0; i < N; i++) {
        cin >> prices[i];
    }
    for (int i = 0; i < N; i++) {
        cin >> nums[i];
    }
    vector<int> dp(C + 1, 0);
    for (int i = 0; i < N; i++) {
        for (int k = 0; k < nums[i]; k++) {
            for (int j = C; j >= weights[i]; j--) {
                dp[j] = max(dp[j], dp[j - weights[i]] + prices[i]);
            }   
        }
    }
    cout << dp[C];
    return 0;
}