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)
prices = [1, 2, 3, 0, 2] maxProfit = 3 transactions = [buy, sell, cooldown, buy, sell]Credits:
Special thanks to @peisi for adding this problem and creating all test cases.
public class Solution {
public int maxProfit(int[] prices) {
if (prices == null || prices.length == 0) return 0;
int n = prices.length;
int buy[] = new int[n];
int sell[] = new int[n];
buy[0] = -prices[0];
sell[0] = 0;
for (int i = 1; i < prices.length; i++) {
buy[i] = Math.max(buy[i - 1], (i == 1 ? 0 : sell[i - 2]) - prices[i]);
sell[i] = Math.max(sell[i - 1], buy[i - 1] + prices[i]);
}
return sell[n - 1];
}
}
public class Solution {
public int maxProfit(int[] prices) {
if (prices == null || prices.length == 0) return 0;
int n = prices.length;
int buy = -prices[0];
int sell = 0;
int prevSell = 0;
for (int i = 1; i < prices.length; i++) {
int tmpBuy = buy;
buy = Math.max(buy, prevSell - prices[i]);
prevSell = sell;
sell = Math.max(sell, tmpBuy + prices[i]);
}
return sell;
}
}
没有评论:
发表评论