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]
此题有点偏难，先上代码：
public class Solution {
public int maxProfit(int[] prices) {
int pre_buy = 0;
int pre_sell = 0;
int buy = Integer.MIN_VALUE;
int sell = 0;
for(int i=0;i<prices.length;i++){
pre_buy = buy;
buy = Math.max(pre_buy,pre_sell-prices[i]);
pre_sell = sell;
sell = Math.max(pre_sell,pre_buy+prices[i]);
}
return sell;
}
理由如下：
buy[i] = Math.max(buy[i-1],sell[i-2]-prices[i]);
sell[i] = Math.max(sell[i-1],buy[i-1]+prices[i]);
其中，sell[i-2]-prices[i]里面，i-1操作为cooldown的时间，就有了如上的代码。