70. 爬楼梯 (进阶)
class Solution {
public:
int climbStairs(int n) {
if(n<=2) return n;
int p1 = 1;
int p2 = 2;
int pn = 0;
while(n>2)
{
pn = p1+p2;
p1 = p2;
p2 = pn;
n--;
}
return pn;
}
};
322. 零钱兑换
class Solution {
public:
int coinChange(vector<int>& coins, int amount) {
if(amount==0) return 0;
vector<int> dp(amount+1, INT32_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]]!=INT32_MAX) dp[j] = min(dp[j-coins[i]]+1, dp[j]);
}
}
if(dp[amount]==INT32_MAX) return -1;
return dp[amount];
}
};
279.完全平方数
class Solution {
public:
int numSquares(int n) {
vector<int> dp(n+1, INT32_MAX);
dp[0] = 0;
for(int i=0; i*i<=n; i++)
{
for(int j=i*i; j<=n; j++)
{
if(dp[j-i*i]!=INT32_MAX) dp[j] = min(dp[j-i*i]+1, dp[j]);
}
}
return dp[n];
}
};