Week 11 Best Time to Buy and Sell Stock with Cooldown

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:

Input: [1,2,3,0,2]
Output: 3 
Explanation: transactions = [buy, sell, cooldown, buy, sell]

分析

题意是：给定一个数组，代表了n天的股价。你可以交易任意多次，但是不允许交易之间相交，即上次买入的必须卖出之后才允许再去买入。并且卖完之后必须是要休息一天
这一问题是典型的DP问题。DP的关键是寻找变量来表示状态，并推导转移函数。
这个问题的自然状态是3种可能的交易：buy,sell,rest,（rest表示当天没有交易，aka cooldown)，然后事务序列可以以这三种状态中的任何一种结束。
对每种情况使用一个数组：buy[n],sell[n],rest[n]
buy[i] 代表 i日之前 maxProfit （对 以buy结束的状态）.
sell[n] 代表 i日之前 maxProfit （对 以sell结束的状态）.
rest[n] 代表i日之前 maxProfit （对 以sell结束的状态）.
有：

buy[i]  = max(rest[i-1]-price, buy[i-1]) 
sell[i] = max(buy[i-1]+price, sell[i-1])
rest[i] = max(sell[i-1], buy[i-1], rest[i-1])
而且
rest[i] = max(sell[i-1], rest[i-1])

c++代码

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;
}