309. Best Time to Buy and Sell Stock with Cooldown

  • 40.1%

https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/#/description

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)

1
2
3
4
5
Example:

prices = [1, 2, 3, 0, 2]
maxProfit = 3
transactions = [buy, sell, cooldown, buy, sell]

cpp

2ms, September 10, 2016

https://discuss.leetcode.com/topic/30421/share-my-thinking-process

1
2
3
4
5
6
7
8
9
10
11
12
public class Solution {
public int maxProfit(int[] prices) {
int sell = 0, prev_sell = 0, buy = Integer.MIN_VALUE, prev_buy;
for(int price:prices){
prev_buy = buy;
buy = Math.max(prev_sell - price, prev_buy);
prev_sell = sell;
sell = Math.max(prev_buy + price , prev_sell);
}
return sell;
}
}

python

39ms, September 10, 2016

https://discuss.leetcode.com/topic/30421/share-my-thinking-process

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
class Solution(object):
def maxProfit(self, prices):
"""
:type prices: List[int]
:rtype: int
"""
if len(prices) < 2:
return 0
sell, buy, prev_sell, prev_buy = 0, -prices[0], 0, 0
for price in prices:
prev_buy = buy
buy = max(prev_sell - price, prev_buy)
prev_sell = sell
sell = max(prev_buy + price, prev_sell)
return sell
谢谢你,可爱的朋友。