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)
Input: [1,2,3,0,2] Output: 3 Explanation: transactions = [buy, sell, cooldown, buy, sell]
针对 一个方法团灭 6 道股票问题 - 最佳买卖股票时机含冷冻期 - 力扣（LeetCode） 这个解题框架，进行小试牛刀。
这里有一点需要注意：由于卖出后，需要隔一天才能再次买入。所以，需要保存前一天"为空"状态的值。
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:
Input: [1,2,3,0,2] Output: 3 Explanation: transactions = [buy, sell, cooldown, buy, sell]
link:{sourcedir}/_0309_BestTimeToBuyAndSellStockWithCooldown.java[role=include]