70. 爬楼梯
知识点:动规
状态:没懂,需要重新看
思路:
class Solution {
public:
int climbStairs(int n) {
vector<int> dp(n + 1, 0);
dp[0] = 1;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= 2; j++) { // 把m换成2,就可以AC爬楼梯这道题
if (i - j >= 0) dp[i] += dp[i - j];
}
}
return dp[n];
}
};
322. 零钱兑换
知识点:动规
状态:没懂,需要重新看
思路:
class Solution {
public:
int coinChange(vector<int>& coins, int amount) {
vector<int> dp( amount+1,INT_MAX);
//dp[i][j]=dp[i-1][j] + dp[i-1][j - weight[i] ] + vale[i];
//dp[j] = dp[j] + dp[j - weight[i]] + valve[i];
dp[0] = 0;
for(int i = 0; i < coins.size();i++) {//wupin
for(int j = coins[i]; j < amount +1 ; j++) { //beibao
if (dp[j - coins[i]] != INT_MAX) {
// 如果dp[j - coins[i]]是初始值则跳过
// 说明dp[j - coins[i]]此时无法用零钱得到
dp[j] = min(dp[j], dp[j - coins[i]] + 1);
}
}
}
if (dp[amount] == INT_MAX) return -1;
return dp[amount];
}
};
279. 完全平方数
知识点:动规
状态:没懂,需要重新看
class Solution {
public:
int numSquares(int n) {
//zhongliang i jiazhi i2
vector<int> dp(n+1, INT_MAX);
//dp[j] = min(dp[j], dp[j - weight[i]] + value[i]);
dp[0] = 0;
for(int i = 1; i <=n ; i++) {
for(int j = i*i; j <= n; j++) {
dp[j] = min(dp[j], dp[j - i*i] + 1 );
}
}
return dp[n];
}
};