Best Time to Buy and Sell Stock with Cooldown

题目：

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]

Credits:
Special thanks to @dietpepsi for adding this problem and creating all test cases.

Subscribe to see which companies asked this question.

解释：這道题比较简单，找最高价位以及最低价位即可，题目有如下限制：

设计一个求最大利润的算法。您可以完成尽可能多的交易，如您所喜欢的（即购买一个，并出售一次股票的多次）与以下限制：
你不可能同时进行多个交易（即你必须在再次买入之前卖出股票）。
你卖掉股票后第二天就买不到股票了。（即冷却时间1天）

在写算法得过程中我们在最高价卖出最低价买入，但卖出后有冷却时间哟。以下是我的程序

程序：

class Solution {
public:
    int maxProfit(vector<int>& prices) {
         int buy(INT_MIN), sell(0), prev_sell(0), prev_buy;
        for (int price : prices) {
            prev_buy = buy;
            buy = max(prev_sell - price, buy);
            prev_sell = sell;
            sell = max(prev_buy + price, sell);
        }
        return sell;
    }
};