代码随想录Day44：携带研究材料、零钱兑换 II、组合总和 Ⅳ

携带研究材料

#include<iostream>
#include<vector>
using namespace std;

int n, barweight;
void solve(){
    vector<int> value(n, 0);
    vector<int> weight(n, 0);
    for(int i = 0; i < n; i++){
        cin >> weight[i];
        cin >> value[i];
    }
    vector<int> dp(barweight + 1, 0);
    for(int i = 1; i <= barweight; i++){//先遍历背包
        for(int j = 0; j < n; j++){
            if(i >= weight[j]) dp[i] = max(dp[i], dp[i - weight[j]] + value[j]);
        }
    }
    cout << dp[barweight] <<endl;
    return;
}

int main(){
    cin >> n;
    cin >> barweight;
    solve();
    return 0;
}

零钱兑换 II

class Solution {
public:
    //背包容量为amount；
    //物品种类为coins.size(), 重量和价值均为coins[i]；
    //完全背包问题；
    //dp[i]为背包容量为i时有dp[i]种组合方法；
    int change(int amount, vector<int>& coins) {
        vector<int> dp(amount + 1, 0);
        dp[0] = 1;
        for(int i = 0; i < coins.size(); i++){
            for(int j = coins[i]; j <= amount; j++){
                dp[j] += dp[j - coins[i]];
            }
        }
        return dp[amount];
    }
};

组合总和 Ⅳ

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