LeetCode123.买卖股票的最佳时机III

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        vector<vector<int>> dp(prices.size(), vector<int>(5, 0));
        /*
        * dp[i][j]
        * i:第i天
        * j为1:第一次持有 j为2：第一次不持有
        * j为3:第二次持有 j为2：第二次不持有
        */
        dp[0][1] = -prices[0];
        dp[0][2] = 0;
        dp[0][3] = -prices[0];
        dp[0][4] = 0;
        int maxProfit = 0;
        for (int i = 1; i < prices.size(); i++) {
            dp[i][1] = max(dp[i - 1][1], -prices[i]);
            dp[i][2] = max(dp[i - 1][2], dp[i - 1][1] + prices[i]);
            dp[i][3] = max(dp[i - 1][3], dp[i - 1][2] - prices[i]);
            dp[i][4] = max(dp[i - 1][4], dp[i - 1][3] + prices[i]);
            int tempMax1 = max(dp[i][1], dp[i][2]);
            int tempMax2 = max(dp[i][3], dp[i][4]);
            int tempMax3 = max(tempMax1, tempMax2);
            maxProfit = max(maxProfit, tempMax3);
        }
        return maxProfit;
    }
};