LeetCode 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).

public class Solution {
    public int maxProfit(int[] prices) {
        if (prices.length<=1) {
            return 0;
        }

        int[] left = new int[prices.length];
        int[] right = new int[prices.length];
        int min = prices[0];
        for (int i = 1; i < prices.length; i++) {
            left[i] = left[i - 1] > prices[i] - min ? left[i - 1] : prices[i] - min;
            min = min < prices[i] ? min : prices[i];
        }

        int max = prices[prices.length - 1];
        for (int i = prices.length - 2; i >= 0; i--) {
            right[i] = right[i + 1] > max - prices[i] ? right[i + 1] : max - prices[i];
            max = max > prices[i] ? max : prices[i];
        }
        int sum = Integer.MIN_VALUE;
        for (int i = 0; i < left.length; i++) {
            sum = sum > left[i] + right[i] ? sum : left[i] + right[i];
        }
        return sum;
    }
}