Best Time to Buy and Sell Stock III

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 at most two transactions.

Note: You may not engage in multiple transactions at the same time (i.e., you must sell the stock before you buy again).

Example 1:

Input: [3,3,5,0,0,3,1,4]
Output: 6
Explanation: Buy on day 4 (price = 0) and sell on day 6 (price = 3), profit = 3-0 = 3.
Then buy on day 7 (price = 1) and sell on day 8 (price = 4), profit = 4-1 = 3.
Example 2:

Input: [1,2,3,4,5]
Output: 4
Explanation: Buy on day 1 (price = 1) and sell on day 5 (price = 5), profit = 5-1 = 4.
Note that you cannot buy on day 1, buy on day 2 and sell them later, as you are
engaging multiple transactions at the same time. You must sell before buying again.
Example 3:

Input: [7,6,4,3,1]
Output: 0
Explanation: In this case, no transaction is done, i.e. max profit = 0.

说明：在交易期内，最多可交易2次（1次交易为：买入和卖出）
由于股票的交易是先买入，再卖出，2次交易的过程是买入->卖出->买入->卖出，在第0~i天内进行第一次交易，在i+1 ~ n内进行第二次 交易。所以先从前往后遍历price，计算0 ~ i内的1次交易的最大利润l[i]。从后往前遍历，计算i ~ n内的最大利润r[i]，当r[i]+l[i]为最大时即为所求

class Solution {
    public int maxProfit(int[] prices) {
        int n = prices.length;
        if(n < 2) {
            return 0;
        }
        
        int[] lm = new int[ n + 1];
        int min = prices[0];
        
        for(int i = 1; i< n; i++) {
            if(prices[i] < min) {
                min = prices[i];
            } else {
                lm[i] = Math.max(lm[i - 1], prices[i] - min);
            }
        }
        
        int max = prices[n - 1];
        int sum = lm[n - 1];
        int rm = 0;
        for(int i = prices.length - 2; i >= 0; i--){
            if(prices[i] > max) {
                max = prices[i];
            } else {
                rm = Math.max(rm, max - prices[i]);
            }
            sum = Math.max(sum, lm[i] + rm);
        }
        return sum;
    }
}