Leetcode 股票 121 122 123 188 309

最新推荐文章于 2024-08-06 00:07:27 发布

Zoeyii935

最新推荐文章于 2024-08-06 00:07:27 发布

阅读量45

点赞数

文章标签： leetcode 算法数据结构

本文链接：https://blog.csdn.net/Zoeyii/article/details/131906176

版权

121. Best Time to Buy and Sell Stock

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        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],-prices[i]);
            dp[i][1] = max(dp[i-1][1], prices[i]+dp[i-1][0]);
        } 
        return dp[prices.size()-1][1];
    }
};

这里的dp[i][0]表示的是持有股票

122. Best Time to Buy and Sell Stock II

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        int len = prices.size();
        vector<vector<int>> dp(len, vector<int>(2,0));
        dp[0][0] -= prices[0];
        dp[0][1] = 0;
        for(int i=1; i<len; 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]);
        }

        return dp[len-1][1];
    }
};

123. Best Time to Buy and Sell Stock III

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

        //dp[i][0] 没有操作
        //dp[i][1] 第一次持有
        //dp[i][2] 第一次不持有
        //dp[i][3] 第二次持有
        //dp[i][4] 第二次不持有
        dp[0][0] = dp[0][2] = dp[0][4] = 0;
        dp[0][1] = dp[0][3] = -prices[0];
        for(int i=1; i<len; i++){
            dp[i][0] = dp[i-1][0];
            dp[i][1] = max(dp[i-1][1], dp[i-1][0]-prices[i]);
            dp[i][2] = max(dp[i-1][2], dp[i-1][1]+prices[i]);
            dp[i][3] = max(dp[i-1][3], dp[i-1][2]-prices[i]);
            dp[i][4] = max(dp[i-1][4], dp[i-1][3]+prices[i]);
        }
        return dp[len-1][4];
    }
};

我觉得最主要就是弄明白一共有几个状态

188. Best Time to Buy and Sell Stock IV

class Solution {
public:
    int maxProfit(int k, vector<int>& prices) {
        vector<vector<int>> dp(prices.size(), vector<int>(2*k+1, 0));
        //dp[x][0]无操作
        //dp[x][1][3]第n持有
        for(int i=0; i<2*k+1; i++){
            if(i%2==0){
                dp[0][i] = 0;
            }else{
                dp[0][i] = -prices[0];
            }
        }

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

        return dp[prices.size()-1][2*k];
    }
};

309. Best Time to Buy and Sell Stock with Cooldown

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        vector<vector<int>> dp(prices.size(), vector<int>(4, 0));
        //dp[i][0] 持有股票的状态
        //dp[i][1] 保持卖出的状态
        //dp[i][2] 卖出股票的状态
        //dp[i][3] 冷冻期

        dp[0][0] = -prices[0];

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

        int n = prices.size();

        return max(dp[n-1][1], max(dp[n-1][2], dp[n-1][3]));
    }
};

这几个状态有点绕，要想清楚