322. 零钱兑换
题目链接:LeetCode322.零钱兑换
文档讲解:代码随想录LeetCode322.零钱兑换
题解
class Solution {
public:
int coinChange(vector<int>& coins, int amount) {
vector<int> dp(amount + 1, INT_MAX);
dp[0] = 0;
for (int i = 0; i < coins.size(); i++) {
for (int j = coins[i]; j <= amount; j++) {
if (dp[j - coins[i]] != INT_MAX) {
dp[j] = min(dp[j], dp[j - coins[i]] + 1);
}
}
}
if (dp[amount] == INT_MAX) {
return -1;
}
return dp[amount];
}
};
- 时间复杂度:O(mn)
- 空间复杂度:O(m)
279. 完全平方数
题目链接:LeetCode279.完全平方数
文档讲解:代码随想录LeetCode279.完全平方数
题解
class Solution {
public:
int numSquares(int n) {
vector<int> dp(n + 1, INT_MAX);
dp[0] = 0;
for (int i = 0; i <= n; i++) {
for (int j = 1; j * j <= i; j++) {
dp[i] = min(dp[i], dp[i - j * j] + 1);
}
}
return dp[n];
}
};
- 时间复杂度:O(n^(3/2))
- 空间复杂度:O(n)
139. 单词拆分
题目链接:LeetCode139.单词拆分
文档讲解:代码随想录LeetCode139.单词拆分
题解
目标单词看作背包,单词集合中的单词看作物品,类似于排列数,先遍历背包,再遍历物品
class Solution {
public:
bool wordBreak(string s, vector<string>& wordDict) {
unordered_set<string> wordSet(wordDict.begin(), wordDict.end());
vector<bool> dp(s.size() + 1, 0);
dp[0] = true;
for (int j = 1; j <= s.size(); j++) {
for (int i = 0; i <= j; i++) {
string word = s.substr(i, j - i);
if (wordSet.find(word) != wordSet.end() && dp[i]) {
dp[j] = true;
}
}
}
return dp[s.size()];
}
};
- 时间复杂度:O(n^3)
- 空间复杂度:O(n)