[leetcode] 309. Best Time to Buy and Sell Stock with Cooldown

原创 2016年02月22日 11:40:30

题目:
Say you have an array for which the ith element is the price of a given stock on day i.

Design an algorithm to find the maximum profit. You may complete as many transactions as you like (ie, buy one and sell one share of the stock multiple times) with the following restrictions:

You may not engage in multiple transactions at the same time (ie, you must sell the stock before you buy again).
After you sell your stock, you cannot buy stock on next day. (ie, cooldown 1 day)
Example:

prices = [1, 2, 3, 0, 2]
maxProfit = 3
transactions = [buy, sell, cooldown, buy, sell]
题意:
给定一个数组,代表了n天的股价。你可以交易任意多次,但是不允许交易之间相交,即上次的买必须卖出之后才允许再去买入。不过加了个条件,卖完之后必须是要休息一天。
思路:
状态的跳转依旧是时间之间的跳转,即第i天的收益情况依赖于第i-1天的收益情况。不过现在需要三个状态,即buy,sell,cooldown,我们记录第i-1天的这三个状态的收益情况是last_ buy,last_sell,last_cooldown。那么第i天的这三个收益情况的依赖关系是:
buy=max(last_buy, last_cooldown - price[i])
sell = max(last_sell, last_buy + price[i])
cooldown = max(cooldown, last_sell);
然后就是每天计算完之后将该天的这三个状态值赋值last。
代码如下:

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        int last_sell = 0, last_buy = INT_MIN, last_cooldown = 0, sell = 0, buy = 0, cooldown = 0;
        for(auto price:prices) {
            buy = max(last_buy, last_cooldown - price);
            sell = max(last_sell, last_buy + price);
            cooldown = max(last_cooldown, last_sell);
            last_buy = buy;
            last_sell = sell;
            last_cooldown = cooldown;
        }
        return sell;
    }
};

相关文章推荐

[leetcode 309]Best Time to Buy and Sell Stock with Cooldown--买卖股票with冷却期(DP法)

Question: Say you have an array for which the ith element is the price of a given stock on day ...

leetcode -- Best Time to Buy and Sell Stock with Cooldown -- 不理解

https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/
  • xyqzki
  • xyqzki
  • 2015年12月11日 12:39
  • 3553

309. Best Time to Buy and Sell Stock with Cooldown

Say you have an array for which the ith element is the price of a given stock on day i. Design an...

leetcode刷题,总结,记录,备忘 309

leetcode309 Best Time to Buy and Sell Stock with Cooldown Say you have an array for which the i...

【LeetCode】 Best Time to Buy and Sell Stock I II III IV 解题报告

Best Time to Buy and Sell Stock I题意:用一个数组表示股票每天的价格,数组的第i个数表示股票在第i天的价格。 如果只允许进行一次交易,也就是说只允许买一支股票并卖掉,求...
  • ljiabin
  • ljiabin
  • 2015年04月06日 11:10
  • 20684

[leetcode] 309. Best Time to Buy and Sell Stock with Cooldown 解题报告

题目链接:https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/ Say you have an ...

LeetCode笔记:309. Best Time to Buy and Sell Stock with Cooldown

使用动态规划计算股票买入、卖出、休息三种操作后的最大收益

[Leetcode] 309. Best Time to Buy and Sell Stock with Cooldown 解题报告

题目: Say you have an array for which the ith element is the price of a given stock on day i. ...

Leetcode 309. Best Time to Buy and Sell Stock with Cooldown

这道题初开始有一些不知所措,所以参考了一下网上的状态转移方程。题目Say you have an array for which the ith element is the price of a g...

【LeetCode】309. Best Time to Buy and Sell Stock with Cooldown

题目: Say you have an array for which the ith element is the price of a given stock on day i.Design a...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:[leetcode] 309. Best Time to Buy and Sell Stock with Cooldown
举报原因:
原因补充:

(最多只允许输入30个字)