代码随想录算法训练营第四十二天 | 动态规划 part09

最新推荐文章于 2024-08-14 11:57:07 发布

sagen aller

最新推荐文章于 2024-08-14 11:57:07 发布

阅读量113

点赞数 1

文章标签：算法动态规划

本文链接：https://blog.csdn.net/qq_43456971/article/details/141156955

版权

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

class Solution {
public:
    int maxProfit(int k, vector<int>& prices) {
        // dp[i][0]-dp[i][2k]
        vector<vector<int>> dp(prices.size(), vector<int>(2 * k + 1, 0));
        for (int j = 1; j < 2 * k; j += 2) {
            dp[0][j] = -prices[0];
        }

        for (int i = 1; i < prices.size(); ++i) {
            for (int j = 0; j < 2*k; j += 2) {
                dp[i][j + 1] = max(dp[i - 1][j + 1], dp[i - 1][j] - prices[i]);
                dp[i][j + 2] = max(dp[i - 1][j + 2], dp[i - 1][j + 1] + prices[i]);
            }
        }
        return dp.back().back();
    }
};

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

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        // dp[i][0]:持有股票状态 = max(dp[i - 1][0], 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]

        vector<vector<int>> dp(prices.size(), vector<int>(4, 0));
        dp[0][0] = -prices[0];
        
        for (int i = 1; i < prices.size(); ++i) {
            dp[i][0] = max(max(dp[i - 1][0], 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(max(dp.back()[1], dp.back()[2]), dp.back()[3]);
    }
};

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

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];
        
        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.back().back();
    }
};