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 + 1; 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;
else
return dp[amount];
}
};
class Solution {
public:
int numSquares(int n) {
vector<int> dp(n + 1, INT_MAX);
dp[0] = 0;
for (int i = 1; i * i <= n; ++i) {
for (int j = i * i; j < n + 1; j++) {
if (dp[j - i * i] != INT_MAX)
dp[j] = min(dp[j], dp[j - i * i] + 1);
}
}
return dp[n];
}
};
class Solution {
public:
bool wordBreak(string s, vector<string>& wordDict) {
vector<bool> dp(s.size() + 1, false);
dp[0] = true;
unordered_set wordSet(wordDict.begin(), wordDict.end());
for (int j = 0; j < s.size() + 1; ++j) {
for (int i = 0; i < j; ++i) {
string ij = s.substr(i, j - i);
if (dp[i] == true && wordSet.find(ij) != wordSet.end())
dp[j] = true;
}
}
return dp[s.size()];
}
};