309. Best Time to Buy and Sell Stock with Cooldown【M】【56】
2016-05-30 16:05
423 查看
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:
Credits:
Special thanks to @dietpepsi for adding this problem and creating all test cases.
Subscribe to see which companies asked this question
引入辅助数组
状态转移方程:
所求最大收益为
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
引入辅助数组
sells和
buys
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]
相关文章推荐
- vi编辑器的基本使用命令
- python的metaclass
- C#遍历Dictionary
- iOS版本比较方法
- 第二阶段个人总结03
- Java工具类实现校验公民身份证的有效性
- HTML开发过程个人心得与小技巧
- Firefox浏览器提示此地址访问受限怎么办 | 访问非80端口,Firefox受限制解决方法
- android 自定义toast停留时间
- 94. Binary Tree Inorder Traversal
- 算法6— 判断两个链表是否相交
- vector map删除元素
- CSS背景图拉伸自适应尺寸,全浏览器兼容
- 【android】:android颜色表
- ThinkPHP(1)——创建ThinkPHP项目
- MVC返回JSON数据格式书写方式
- linux脚本:ftp自动传输文件
- input 正则控制输入
- springmvc默认首页问题
- Struts2源码分析