leetcode - Best Time to Buy and Sell Stock IV

最新推荐文章于 2024-09-16 06:54:08 发布

wenii

最新推荐文章于 2024-09-16 06:54:08 发布

阅读量278

点赞数

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/wenii/article/details/51626571

版权

leetcode 专栏收录该内容

7 篇文章 0 订阅

订阅专栏

class Solution {
public:
    int maxProfit(int k, vector<int>& prices) {
        if (k == 0 || prices.empty()) {
            return 0;
        }
        if (k > prices.size()/2) return help(prices);
        vector<int> pre(prices.size(), 0);
        vector<int> f(prices.size(), 0);
        for (int i = 0; i < k; ++i) {
            int tmp = f[0]-prices[0];
            for (int j = 1; j < prices.size(); ++j) {
                f[j] = max(f[j-1], prices[j]+tmp);
                tmp = max(tmp, pre[j-1]-prices[j]);
            }
            pre = f;
        }
        return f.back();
    }
    int help(vector<int>& prices) {
        int result = 0;
        for (int i = 1; i < prices.size(); ++i) {
            result += prices[i]>prices[i-1]?prices[i]-prices[i-1]:0;
        }
        return result;
    }
};

AC
12ms
beat 19.89%

两个要点
1.k值可能很大，所以要判断是否大于最大可交易次数，大于相当于Best Time to Buy and Sell Stock I
2.通过tmp和pre获得到j-1天买i-1次卖i-2次的最大收益；类比的是Best Time to Buy and Sell Stock III的最佳解法

f[j] = max(f[j-1], prices[j]+tmp);
tmp = max(tmp, pre[j-1]-prices[j]);

discuss

public:
    int maxProfit(int k, vector<int> &prices) {
        int len = prices.size();
        if (len<2) return 0;
        if (k>len/2){ // simple case
            int ans = 0;
            for (int i=1; i<len; ++i){
                ans += max(prices[i] - prices[i-1],0);
            }
            return ans;
        }
        int hold[k+1];
        int rele[k+1];
        for (int i=0;i<=k;++i){
            hold[i] = INT_MIN;
            rele[i] = 0;
        }
        int cur;
        for (int i=0; i<len; ++i){
            cur = prices[i];
            for(int j=k; j>0; --j){
                rele[j] = max(rele[j],hold[j] + cur);
                hold[j] = max(hold[j],rele[j-1] - cur);
            }
        }
        return rele[k];
    }
};