leetcode刷题，总结，记录，备忘 309

leetcode309 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

动态规划的方法我到现在还是不太会用，这题目还是借助了别人博客的帮忙。首先建立2个数组，一个buy一个sell，buy[0]肯定是-prices[0]，buy[1]就是前2天的价格的负数中的较大者，考虑亏的最少的情况，即买进价格最低。sell[0]为0，因为第一天没有卖，所以是0,sell[1]为0和第二天减去第一天的价格差中的较大者，即这个sell数组存放最大利润。

之后可以得到递推公式buy[i] = max(buy[i-1], sell[i-2] - prices[i])因为中间有cooldown，所以卖价需要找2天前的卖价，取前一天买和今天买的价格中最不亏的价格，即买进价格最低的。

sell[i] = max(sell[i-1], buy[i-1] + prices[i])取钱一天卖出之后赚的钱和今天如果卖的话之间的最大值，即赚最多的。可能说的比较抽象，需要自己用笔写写画画更好理解。

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