[自我记录]随想录刷题第三十九天 | 70. 爬楼梯, 322. 零钱兑换, 279. 完全平方数

代码随想录算法打卡第三十九天, 新手自我记录一下刷题历程, 仅为自我打卡使用.

---

70. 爬楼梯

class Solution {
public:
    int climbStairs(int n) {
        if (n < 2) return n;
        vector<int> dp(n + 1, 0);
        dp[0] = 1;
        dp[1] = 1;
        for (int j = 2; j <= n; ++j) {
            for (int i = 1; i <= 2; ++i) {
                dp[j] += dp[j - i];
            }
        }
        return dp[n];
    }
};

---

322. 零钱兑换

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 - 1)
                    dp[j] = min(dp[j], dp[j - coins[i]] + 1);
            }
        }
        if (dp[amount] == INT_MAX) return -1;
        return dp[amount];
    }
};

---

279. 完全平方数

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; ++j) {
                if (dp[j - i * i] != INT_MAX) {
                    dp[j] = min(dp[j], dp[j - i * i] + 1);
                }
            }
        }
        return dp[n];
    }
};

---

希望还能再坚持一天!