LeetCode 123. Best Time to Buy and Sell Stock III

Description

Say you have an array for which the $i^{th}$ element is the price of a given stock on day i <script type="math/tex" id="MathJax-Element-2">i</script>.
Design an algorithm to find the maximum profit. You may complete at most two transactions.
Note:
You may not engage in multiple transactions at the same time (ie, you must sell the stock before you buy again).

Solution

题意要求最多交易两次，找到最大利润，利用动态规划找出递推公式来分别更新两个变量local和global，求至少k次交易的最大利润，找到通解后可以设定k = 2，即为所求。定义local[i][j]为在到达第i天时最多可进行j次交易且最后一次交易在最后一天卖出的最大利润，此为局部最优值。定义global[i][j]为在到达第i天时最多可进行j次交易的最大利润，此为全局最优值。其递推式为：

local[i][j]=max(global[i-1][j-1]+max(diff,0),local[i-1][j]+diff)

global[i][j]=max(local[i][j],global[i-1][j])

其中局部最优值是比较前一天并少交易一次的全局最优加上大于0的差值，和前一天的局部最优值加上差值中取较大值，而全局最优值比较局部最优值和前一天的全局最优值。

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