123 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 == null || prices.length == 0)
return 0;
int[] local = new int[3];
int[] global = new int[3];
for(int i = 1; i < prices.length; i ++) {
int diff = prices[i] - prices[i - 1];
for(int j = 2; j >= 1; j --) {
local[j] = Math.max(global[j - 1] + Math.max(diff, 0), local[j] + diff);
global[j] = Math.max(global[j], local[j]);
}
}
return global[2];
}
}

198 / 198 test cases passed.
Status: Accepted
Runtime: 9 ms