leetcode Best Time to Buy and Sell Stock with Cooldown
2015-11-27 18:17
387 查看
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]
原文地址 http://www.hrwhisper.me/leetcode-best-time-to-buy-and-sell-stock-with-cooldown/
题目地址:https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/
题意:
给定一个数组prices,prices[i]代表第i天股票的价格。让你进行若干次买卖,求最大利润
你每次只能买一支而且在再次买入之前必须出售之前手头上的股票(就是手头上最多有一支股票)
每次出售需要休息一天才能再次买入
设sell[i] 卖出操作的最大利润。它需要考虑的是,第i天是否卖出。(手上有stock在第i天所能获得的最大利润)
buy[i] 买进操作的最大利润。它需要考虑的是,第i天是否买进。(手上没有stock在第i天所能获得的最大利润)
所以,显然有状态转移方程
buy[i] = max(buy[i-1] , sell[i-2] – prices[i]) // 休息一天在买入,所以是sell[i-2]在状态转移
sell[i] = max(sell[i-1], buy[i-1] + prices[i])
最后显然有sell[n-1] > buy[n-1] 所以我们返回sell[n-1]
本文地址(就是我的新blog):http://www.hrwhisper.me/leetcode-best-time-to-buy-and-sell-stock-with-cooldown/
本文由 hrwhisper 原创发布,转载请点名出处
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]
原文地址 http://www.hrwhisper.me/leetcode-best-time-to-buy-and-sell-stock-with-cooldown/
题目地址:https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/
题意:
给定一个数组prices,prices[i]代表第i天股票的价格。让你进行若干次买卖,求最大利润
你每次只能买一支而且在再次买入之前必须出售之前手头上的股票(就是手头上最多有一支股票)
每次出售需要休息一天才能再次买入
设sell[i] 卖出操作的最大利润。它需要考虑的是,第i天是否卖出。(手上有stock在第i天所能获得的最大利润)
buy[i] 买进操作的最大利润。它需要考虑的是,第i天是否买进。(手上没有stock在第i天所能获得的最大利润)
所以,显然有状态转移方程
buy[i] = max(buy[i-1] , sell[i-2] – prices[i]) // 休息一天在买入,所以是sell[i-2]在状态转移
sell[i] = max(sell[i-1], buy[i-1] + prices[i])
最后显然有sell[n-1] > buy[n-1] 所以我们返回sell[n-1]
class Solution(object): def maxProfit(self, prices): """ :type prices: List[int] :rtype: int """ if not prices or len(prices) < 2: return 0 n = len(prices) buy, sell = [0] * n, [0] * n buy[0] = -prices[0] buy[1] = max(-prices[0], -prices[1]) sell[1] = max(0, prices[1] - prices[0]) for i in xrange(2, n): buy[i] = max(sell[i - 2] - prices[i], buy[i - 1]) sell[i] = max(buy[i - 1] + prices[i], sell[i - 1]) return sell[n - 1]
本文地址(就是我的新blog):http://www.hrwhisper.me/leetcode-best-time-to-buy-and-sell-stock-with-cooldown/
本文由 hrwhisper 原创发布,转载请点名出处
相关文章推荐
- spring hadoop系列(五)---spring hadoop hbase之HbaseSynchronizationManager
- java报“非法字符: \65279 ”错误的解决方法
- 为jsoncpp添加Android版本Makefile
- POJ 3321 Apple Tree 【树状数组 dfs记录时间戳】
- Android 进阶 Fragment 介绍和使用 (一)
- 总结自己在项目中遇到的问题
- 严重: Error configuring application listener of class org.springframework.web.context.ContextLoaderLi
- C#比较字符串
- Android NDK学习之六、C++ 支持
- 【Jenkins】linux下Jenkins集成ant进行编译并发送结果
- “预”的话题
- Android5.x新特性之ViewDragHelper拖动控件(3种方案)
- update实现多表的更新
- 数据结构上机【构造哈夫曼树,并输出对应节点的哈夫曼编码】
- node.js开发小项目的全过程 2 初识目录结构
- 数据结构实验之图论六:村村通公路
- Android NDK学习之五、Application.mk简介
- (经典)详解WINDOWS映像劫持技术
- C#去除数组重复的元素
- 第二天