代码随想录Day37：卡码网52.携带研究材料、518.零钱兑换II、377.组合总和IV、卡码网70.爬楼梯

卡码网52. 携带研究材料

题目链接：卡码网52.携带研究材料
文档讲解：代码随想录完全背包理论基础

题解

#include <iostream>
#include <vector>
using namespace std;
int main() {
    int N, V;
    cin >> N >> V;
    vector<int> weight;
    vector<int> value;
    for(int i = 0; i < N; i++) {
        int w, v;
        cin >> w >> v;
        weight.push_back(w);
        value.push_back(v);
    }
    vector<int> dp(V + 1, 0);
    for(int i = 0; i < N; i++) {
        for(int j = weight[i]; j <= V; j++){
            dp[j] = max(dp[j], dp[j - weight[i]] + value[i]);
        }
    }
    cout << dp[V] << endl;
    return 0;
}

---

518. 零钱兑换II

题目链接：LeetCode518.零钱兑换II
文档讲解：代码随想录LeetCode518.零钱兑换II

题解

组合数，先遍历物品，再遍历背包

class Solution {
public:
    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];
    }
};

• 时间复杂度：O(mn)
• 空间复杂度：O(m)

---

377. 组合总和IV

题目链接：LeetCode377.组合总和IV
文档讲解：代码随想录LeetCode377.组合总和IV

题解

排列数，先遍历背包，再遍历物品

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

• 时间复杂度：O(mn)
• 空间复杂度：O(m)

---

卡码网70. 爬楼梯

题目链接：卡码网70.爬楼梯
文档讲解：代码随想录爬楼梯（进阶版）

题解

#include <iostream>
#include <vector>
using namespace std;
int main(){
    int n, m;
    cin >> n >> m;
    vector<int> dp(n + 1, 0);
    dp[0] = 1;
    for(int j = 1; j <= n; j++) {
        for(int i = 1; i <= m; i++) {
            if(j >= i) {
                dp[j] += dp[j - i];
            }
        }
    }
    cout << dp[n] << endl;
    return 0;
}

• 时间复杂度：O(nm)
• 空间复杂度：O(n)