零钱兑换
力扣题目链接
class Solution {
public:
int coinChange(vector<int>& coins, int amount) {
if(amount == 0)
return 0;
vector<int> dp(amount+1, INT_MAX-1);
dp[0] = 0;
for(int i = 0; i < coins.size(); i++){
for(int j = coins[i]; j <= amount; j++){
dp[j] = min(dp[j], dp[j-coins[i]] + 1);
}
}
if(dp[amount] == INT_MAX-1)
return -1;
return dp[amount];
}
};
完全平方数
力扣题目链接
class Solution {
public:
int numSquares(int n) {
vector<int>dp(n+1);
for(int i = 0; i <= n; i++){
dp[i] = i;
}
for(int i = 2; i *i <= n; i++){
int num = i*i;
for(int j = num; j <= n; j++){
dp[j] = min(dp[j-num] + 1, dp[j]);
}
}
return dp[n];
}
};
单词拆分
力扣题目链接
class Solution {
public:
bool wordBreak(string s, vector<string>& wordDict) {
vector<bool> dp(s.length()+1, false);
dp[0] = true;
for(int i = 0; i <= s.length(); i++){
for(int j = 0; j < wordDict.size(); j++){
int len = wordDict[j].length();
if(i < len || dp[i-len] == false)
continue;
string str(s.begin()+i-len, s.begin()+i);
if(str == wordDict[j])
dp[i] = true;
}
}
return dp[s.length()];
}
};