Best Time to Buy and Sell Stock III

Best Time to Buy and Sell Stock III

  Total Accepted: 4172  Total Submissions: 19287 My Submissions

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

view the profit from two directions (left and right).

left array is the max profit we can get ending at this point[i].

right array is the max profit we can get starting from this point[i].

e.g:

int[] prices = {3, 1, 2, 5, 0, 2, 4, 7, 2};

int[] left = [0, 0, 1, 4, 4, 4, 4, 7, 7];

int[] right = [7, 7, 7, 7, 7, 5, 3, 0, 0]

if we choose i = 5, then means:

left[5] is the max profit that we can achieve from 0 ~ 5;

right[5] is the max profit that we can achieve from 5 ~ end;

so we just need to find the max left[i] + right[i];

time O(N), space O(N).

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