Leetcode Best Time to Buy and Sell Stock III

题目要求限定两次交易求最大收益，解决方法自然应该想到了二分法和动态规划
public int maxProfit(int[] prices) {
if(prices==null || prices.length<=1){
return 0;
}
int n=prices.length;
int[] preProfit=new int[n];
int[] postProfit=new int[n];
int maxProfit=0;
process(prices,preProfit,postProfit);
System.out.println(Arrays.toString(preProfit));
System.out.println(Arrays.toString(postProfit));
for(int i=0;i<prices.length;i++){
if(preProfit[i]+postProfit[i]>maxProfit){
maxProfit=preProfit[i]+postProfit[i];
}
}
return maxProfit;

}


public void process(int[] prices, int[] preProfit, int[] postProfit) {
// TODO Auto-generated method stub
preProfit[0]=0;
int min=prices[0];
for(int i=1;i<prices.length;i++){
preProfit[i]=Math.max(prices[i]-min, preProfit[i-1]);
min=Math.min(min, prices[i]);
}

postProfit[postProfit.length-1]=0;
int max = prices[postProfit.length-1];
for(int i=prices.length-2;i>=0;i--){
postProfit[i]=Math.max(postProfit[i+1], max-prices[i]);
max=Math.max(max,prices[i]);
}
}