代码随想录第44天|动态规划

188.买卖股票的最佳时机IV

---

309.最佳买卖股票时机含冷冻期


参考

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        vector<vector<int>> dp(prices.size(), vector<int>(4, 0));

        dp[0][0] = -prices[0];
        dp[0][1] = 0;
        dp[0][2] = 0;
        dp[0][3] = 0;
        for (int i = 1; i < prices.size(); i++) {
            dp[i][0] = max(dp[i - 1][0],
                           max(dp[i - 1][1] - prices[i], dp[i - 1][3] - prices[i]));
            dp[i][1] = max(dp[i - 1][1], dp[i - 1][3]); // 保持卖出
            dp[i][2] = dp[i - 1][0] + prices[i];        // 卖出
            dp[i][3] = dp[i - 1][2];                    // 冻结
        }
        return max(dp[prices.size() - 1][1],
                   max(dp[prices.size() - 1][2], dp[prices.size() - 1][3]));
    }
};

---

714.买卖股票的最佳时机含手续费


dp[i][0] : 持有股票的状态 dp[i][0] : 不持有股票的状态

class Solution {
public:
    int maxProfit(vector<int>& prices, int fee) {
        vector<vector<int>> dp(prices.size(), vector<int>(2, 0));
        dp[0][0] = -prices[0];//持有
        dp[0][1] = 0;   //不持有

        for (int i = 1; i < prices.size(); i++) {
            dp[i][0] = max(dp[i - 1][0], dp[i - 1][1] - prices[i]);
            dp[i][1] = max(dp[i - 1][1], dp[i - 1][0] + prices[i] - fee);
        }
        return dp[prices.size() - 1][1];
    }
};

---