70.爬楼梯(进阶)
题目链接:
70.爬楼梯(进阶)
代码:
#include<iostream>
#include<vector>
using namespace std;
int main(){int n,m;cin>>n>>m;vector<int>dp(n+1);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;
}
LeetCode 322.零钱兑换
题目链接:
LeetCode 322.零钱兑换
代码:
class Solution {
public:int coinChange(vector<int>& coins, int amount) {int size = coins.size();vector<int>dp(amount+1,INT_MAX-1);dp[0] = 0;for(int i=0;i<size;i++){//先遍历物品for(int j=1;j<=amount;j++){if(j>=coins[i])dp[j] = min(dp[j-coins[i]]+1,dp[j]);}}return dp[amount]==INT_MAX-1?-1:dp[amount];}
};
279.完全平方数
题目链接:
279.完全平方数
代码:
class Solution {
public:int numSquares(int n) {vector<int>dp(n+1,INT_MAX-1);dp[0]=0;for(int i = 1;i*i<=n;i++){//先遍历物品for(int j = i*i;j<=n;j++){//遍历背包dp[j] = min(dp[j-i*i]+1,dp[j]);}}return dp[n]==INT_MAX-1?-1:dp[n];}
};