【LeetCode】309. 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]

分析：
这道题给了一个数组用来表示n天的股价，交易方式为：可以交易多次，但是在同一时间不允许进行多次交易，即在一次买入后必须卖出才能再次买入。且每次卖出后需要休息一天才能再次买入。要求求出可获得的最大收益。
这是一道动态规划的题目，即当前的收益与之前的收益有关。每一天可以分成两种状态来进行考虑，一种是买入状态，一种是卖出或冷却状态。
所以设两个数组buy和sell。buy[i]表示第i天为买入状态时的收益，sell[i]表示第i天为卖出或冷却状态时的收益。可以得到以下状态转移方程：
buy[i] = max{buy[i-1],sell[i-2]-prices[i]};
sell[i] = max{sell[i-1],buy[i-1]+prices[i]};
初始化时设buy[0] = -prices[0],sell[0] = 0.
代码：

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        vector<int> buy;
        vector<int> sell;
        if(prices.size()<1) return 0;
        if(prices.size() == 2)
        {
            return max(prices[1]-prices[0],0);
        }
        buy.push_back(-prices[0]);
        sell.push_back(0);
        buy.push_back(max(buy[0],-prices[1]));
        sell.push_back(max(sell[0],buy[0]+prices[1]));

        for(int i = 2;i<prices.size();i++)
        {
            buy.push_back(max(buy[i-1],sell[i-2]-prices[i]));
            sell.push_back(max(sell[i-1],buy[i-1]+prices[i]));


        }
        return sell[prices.size()-1];
    }
};