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)

prices = [1, 2, 3, 0, 2]
maxProfit = 3
transactions = [buy, sell, cooldown, buy, sell]

大致意思就是说，给一个股票的价格波动数组，然后第i天可以根据条件决定买卖或者不做任何动作，然后求最后的最大收益。

思路

这道题可能最好理解的是三状态转移方程，时间复杂度为O(n)但其实最后的效果效率好像不是那么高。但是只能看得懂这个呀所以就只写这个啦~
用买卖和无动作三个状态数组来表示在第i天做这个动作可以得到的最大收益。
然后由状态转移方程可以得到:
1.第i天买的最大收益不过超过第i-1天（因为花钱啦）和第i-1天休息然后在第i天花钱的收益。（由于i-1天卖了第i天就不能买，所以这里不考虑i-1天卖的情况）
buy[i] = max(buy[i-1], rest[i-1]-prices[i]);

2.第i天卖的最大收益为前一天买然后在今天卖。（因为必须手上有股票然后才能卖，而buy[i-1]的情况其实已经考虑了在i-1天及以前所有买入的最大收益情况）
sell[i] = buy[i-1]+prices[i];

3.第i天休息的最大收益等于i-1天休息和i-1天卖（今天只能选择休息）的最大值。
rest[i] = max(rest[i-1], sell[i-1]);

代码

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

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