Best Time to Buy and Sell Stock III

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 (ie, you must sell the stock before you buy again).

1. Use two arrays left[i] and right[i] to store the maximum profit before i and after i respectively.

For example, prices = [2, 1, 2, 0 ,1]

                            left = [0, 0, 1, 1, 1]

                          right = [1, 1, 1, 1, 0]

2. From the example above, we can get the max profit is 2.

public class Solution {
    public int maxProfit(int[] prices) {
        if (prices == null || prices.length < 2)
            return 0;
        
        int[] left = new int[prices.length];
        int[] right = new int[prices.length];
        
        int min = prices[0];
        left[0] = 0;
        for (int i = 1; i < prices.length; i++) {
           min = Math.min(prices[i], min);
           left[i] = Math.max(left[i - 1], prices[i] - min);
        }
        
        
        int max = prices[prices.length - 1];
        right[prices.length - 1] = 0;
        for (int i = prices.length - 2; i >= 0; i--) {
           max = Math.max(prices[i], max);
           right[i] = Math.max(right[i + 1], max - prices[i]);
        }
        
        int maxProfit = 0;
        for (int i = 0; i < prices.length; i++) {
            maxProfit = Math.max(left[i] + right[i], maxProfit);
        }
        
        return maxProfit;
    }
}