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

原创 2016年05月30日 16:05:13

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]

Credits:
Special thanks to @dietpepsi for adding this problem and creating all test cases.


Subscribe to see which companies asked this question




引入辅助数组sellsbuys
sells[i]表示在第i天不持有股票所能获得的最大累计收益
buys[i]表示在第i天持有股票所能获得的最大累计收益

初始化数组:
sells[0] = 0
sells[1] = max(0, prices[1] - prices[0])
buys[0] = -prices[0]
buys[1] = max(-prices[0], -prices[1])

状态转移方程:

sells[i] = max(sells[i - 1], buys[i - 1] + prices[i])
buys[i] = max(buys[i - 1], sells[i - 2] - prices[i])

所求最大收益为sells[-1]






class Solution(object):
    def maxProfit(self, prices):
        p = prices
        l = len(p)
        
        if l < 2:
            return 0
        
        hold = [0] * l
        sell = [0] * l
        
        hold[0] = p[0]
        hold[1] = max(-p[0],-p[1])
        
        sell[0] = 0
        sell[1] = max(0,p[1] - p[0])
        
        for i in xrange(2,l):
            #print i
            sell[i] = max(hold[i-1] + p[i], sell[i-1])
            hold[i] = max(sell[i-2] - p[i], hold[i-1])
        
        return sell[-1]


[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. ...

309. Best Time to Buy and Sell Stock with Cooldown -Medium

Question 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...

309. Best Time to Buy and Sell Stock with Cooldown

题目:Best Time to Buy and Sell Stock with Cooldown原题链接:https://leetcode.com/problems/best-time-to-buy-...

309.Best Time to Buy and Sell Stock with Cooldown

1.基本思路:此题可通过DP来解决,但状态转移方程的构想不是那么明显,首先可以通过两个数组来表示买与卖的信息: buy[i]:表示第i天为止,最近一次股票购入后所持有的利润 sell[i]:表示第i天...

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

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

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 ...
  • jmspan
  • jmspan
  • 2016年04月20日 13:34
  • 472

【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 an ...

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

题目309. Best Time to Buy and Sell Stock with Cooldown思路动态规划,改成最优子结构:方法一buyOrSell[i]:表示第i天一定卖的最大利润 递推关...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:309. Best Time to Buy and Sell Stock with Cooldown【M】【56】
举报原因:
原因补充:

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