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)Example:
prices = [1, 2, 3, 0, 2]
maxProfit = 3
transactions = [buy, sell, cooldown, buy, sell]
解题思路:
对于第i天有三种可能:buyi、selli、cooldowni
状态转移方程
buy[i] = max(cooldown[i-1]-prices[i],buy[i-1])
sell[i] = max(buy[i-1]+price[i],sell[i-1])
cooldown[i]=sell[i-1]
public class Best_Time_to_Buy_and_Sell_Stock_with_Cooldown_309 {
/**
* 对于第i天有三种可能:buy[i]、sell[i]、cooldown[i]
* 状态转移方程
* buy[i] = max(cooldown[i-1]-prices[i],buy[i-1])
* sell[i] = max(buy[i-1]+price[i],sell[i-1])
* cooldown[i]=sell[i-1]
* @param prices
* @return
*/
public int maxProfit(int[] prices) {
if(prices==null||prices.length==0)return 0;
int n = prices.length;
int[] buy = new int[n+1];
int[] sell = new int[n+1];
int[] cooldown = new int[n+1];
buy[0] = - prices[0];
sell[0] = 0;
cooldown[0] =0;
for(int i=1;i<prices.length;i++){
buy[i] = Math.max(cooldown[i-1]-prices[i],buy[i-1]);
sell[i] = Math.max(buy[i-1]+prices[i],sell[i-1]);
cooldown[i]=sell[i-1];
}
return sell[n-1];
}
public static void main(String[] args) {
new Best_Time_to_Buy_and_Sell_Stock_with_Cooldown_309().maxProfit(new int[]{1, 2, 3, 0, 2});
}
}