LeeCode 309 DP

题意

传送门 LeeCode 309. 最佳买卖股票时机含冷冻期

题解

考虑按照时间顺序动态规划，观察状态转移，设状态 $1$ 为持有股票，$1$ 为未持有股票且当天卖出，$2$ 为未持有股票且非当天卖出。则递推式为

$$\{\begin{array}{l}dp[i][0]=max(dp[i-1][0],dp[i-1][2]-prices[i]\\ dp[i][1]=dp[i-1][0]+prices[i]\\ dp[i][2]=max(dp[i-1][2],dp[i-1][1])\end{array}$$

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