LeetCode 123. 买卖股票的最佳时机

HumbleFool

已于 2022-08-31 11:46:50 修改

阅读量278

点赞数

分类专栏：算法文章标签： leetcode 算法动态规划

于 2022-08-30 23:50:06 首次发布

本文链接：https://blog.csdn.net/qq_45925322/article/details/126615173

版权

算法专栏收录该内容

106 篇文章 1 订阅

订阅专栏

LeetCode 122. 买卖股票的最佳时机 II
超时 + 超内存

const int N = 3e4 + 10, INF = 0x3f3f3f3f;
class Solution {
public:
    int f[N][N][2];
    int maxProfit(vector<int>& prices) {
        int n = prices.size();
        memset(f, -0x3f, sizeof f);
        for(int i = 0; i <= n; i ++)
            f[i][0][0] = 0;

        int res = 0;
        for(int i = 1; i <= n; i ++)
            for(int j = 1; j <= n; j ++)
            {
                f[i][j][0] = max(f[i - 1][j][0], f[i - 1][j][1] + prices[i - 1]);
                f[i][j][1] = max(f[i - 1][j][1], f[i - 1][j - 1][0] - prices[i - 1]);
                res = max(res, f[i][j][0]);
            }
        return res;
    }
};

优化

const int N = 3e4 + 10, INF = 0x3f3f3f3f;
class Solution {
public:
    int f[N][2];
    int maxProfit(vector<int>& prices) {
        int n = prices.size();
        memset(f, -0x3f, sizeof f);
        for(int i = 0; i <= n; i ++)
            f[i][0] = 0;

        int res = 0;
        for(int i = 1; i <= n; i ++)
        {
            f[i][0] = max(f[i - 1][0], f[i - 1][1] + prices[i - 1]);
            f[i][1] = max(f[i - 1][1], f[i - 1][0] - prices[i - 1]);
            res = max(res, f[i][0]);
        }
        return res;
    }
};

LeetCode 123. 买卖股票的最佳时机 III
在这里插入图片描述
动态规划

const int N = 1e5 + 10, M = 3;
class Solution {
public:
    int f[N][M][2]; // 前i天正在进行j比交易的最大值，k表示是否持有股票
    int maxProfit(vector<int>& prices) {
        int n = prices.size();
        memset(f, -0x3f, sizeof f);
        for(int i = 0; i <= n; i ++)
            f[i][0][0] = 0;

        int res = 0;
        for(int i = 1; i <= n; i ++)
            for(int j = 1; j <= 2; j ++)
            {
                f[i][j][0] = max(f[i - 1][j][0], f[i - 1][j][1] + prices[i - 1]);
                f[i][j][1] = max(f[i - 1][j][1], f[i - 1][j - 1][0] - prices[i - 1]);

                res = max(res, f[i][j][0]);
            }
        return res;
    }
};

LeetCode 188. 买卖股票的最佳时机 IV
在这里插入图片描述

const int N = 1010, M = 110, INF = 0x3f3f3f3f;
class Solution {
public:
    int f[N][M][2];
    int maxProfit(int k, vector<int>& prices) {
        int n = prices.size();
        memset(f, -0x3f, sizeof f);
        for(int i = 0; i <= n; i ++)
            f[i][0][0] = 0;

        int res = 0;
        for(int i = 1; i <= n; i ++)
            for(int j = 1; j <= k; j ++)
            {
                f[i][j][0] = max(f[i - 1][j][0], f[i - 1][j][1] + prices[i - 1]);
                f[i][j][1] = max(f[i - 1][j][1], f[i - 1][j - 1][0] - prices[i - 1]);
                res = max(res, f[i][j][0]);
            }
        return res;
    }
};