[Leetcode] Best Time to Buy and Sell Stock III (Java)

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

规定了最多操作2次

用DP的办法，前向扫面并用pre[i]保存[0,i]的最大结果，后向扫面并用post[i]保存[i+1,n]的最大结果，最后再扫面一次得到最终结果

public class Solution {
    public int maxProfit(int[] prices) {
		
		int max = 0;
		int ret = 0;
		int tmp = 0;
		int[] pre = new int[prices.length];
		int[] post = new int[prices.length];
		
		for (int i = 1; i < prices.length ; i++) {
			if (tmp < 0)
				tmp = 0;
			tmp += prices[i] - prices[i-1];
			ret = Math.max(ret, tmp);
			pre[i]=ret;
		}
		max = ret;
		
		ret = 0;
		tmp = 0;
		for (int i = prices.length-1; i >2; i--) {
			if (tmp < 0)
				tmp = 0;
			tmp += prices[i] - prices[i-1];
			ret = Math.max(ret, tmp);
			post[i-2]=ret;
		}
		
		ret = max;
		for(int i=1;i<prices.length-2;i++){
			ret = Math.max(pre[i]+post[i], ret);
		}
		
		return ret;
    }
}