完全背包
视频讲解:带你学透完全背包问题! 和 01背包有什么差别?遍历顺序上有什么讲究?_哔哩哔哩_bilibili
#include <iostream>
#include <vector>
using namespace std;
vector<pair<int, int>>nums;
int n, bag;
void solve() {
vector<int>dp(bag+1, 0);
for (int i = 0; i < n; i++) {
for (int j = nums[i].first; j <= bag; j++) {
dp[j] = max(dp[j], dp[j - nums[i].first] + nums[i].second);
}
}
cout << dp[bag] << endl;
}
int main() {
cin >> n >> bag;
for (int i=0;i<n;i++){
int x, y; cin >> x >> y;
nums.push_back({ x,y });
}
solve();
}
518. 零钱兑换 II
视频讲解:动态规划之完全背包,装满背包有多少种方法?组合与排列有讲究!| LeetCode:518.零钱兑换II_哔哩哔哩_bilibili
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+1;j++){
dp[j]+=dp[j-coins[i]];
}
}
return dp[amount];
}
};
377. 组合总和 Ⅳ
视频讲解:动态规划之完全背包,装满背包有几种方法?求排列数?| LeetCode:377.组合总和IV_哔哩哔哩_bilibili
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+1;j++){ //表示容量
for (int i=0;i<nums.size();i++){ //表示物品
if (j>=nums[i] && dp[j]<INT_MAX-dp[j-nums[i]])dp[j]+=dp[j-nums[i]];
}
}
return dp[target];
}
};
70. 爬楼梯 (进阶)
这道题目 爬楼梯之前我们做过,这次再用完全背包的思路来分析一遍
#include <iostream>
#include <vector>
using namespace std;
int n, m;
void solve() {
vector<int>dp(n + 1, 0);
dp[1] = 1; dp[0] = 1;//dp[0]的初始化要注意一下
for (int i = 2; i < n + 1; i++) {
for (int j = 1; j <= m && j<=i; j++) {
if (i >= j)dp[i] += dp[i - j];
}
}
cout << dp[n] << endl;
}
int main() {
cin >> n >> m;
solve();
}