代码:
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; ++j) {
dp[j] += dp[j - coins[i]];
}
}
return dp[amount];
}
};
代码:
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; ++j) {
for (int i = 0; i < nums.size(); ++i) {
if (j - nums[i] >= 0 && dp[j] < INT_MAX - dp[j-nums[i]])
dp[j] += dp[j - nums[i]];
}
}
return dp[target];
}
};
代码:
class Solution {
public:
int coinChange(vector<int>& coins, int amount) {
vector<int> dp(amount + 1, INT_MAX);
dp[0] = 0;
sort(coins.begin(), coins.end());
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];
}
};
代码:
class Solution {
public:
int numSquares(int n) {
vector<int> dp(n + 1, INT_MAX);
int numMax = sqrt(n);
dp[0] = 0;
for (int i = 1; i <= numMax; ++i) {
for (int j = i*i; j <= n; ++j) {
dp[j] = min(dp[j], dp[j - i*i] + 1);
}
}
return dp[n];
}
};
代码:
class Solution {
public:
bool wordBreak(string s, vector<string>& wordDict) {
unordered_set<string> wordSet(wordDict.begin(), wordDict.end());
vector<bool> dp(s.size() + 1, false);
dp[0] = true;
for (int i = 1; i <= s.size(); ++i) {
for (int j = 0; j < i; ++j) {
string word = s.substr(j, i - j);
if (wordSet.find(word) != wordSet.end() && dp[j]) {
dp[i] = true;
}
}
}
return dp[s.size()];
}
};
参考资料:
代码随想录