LeetCode best-time-to-buy-and-sell-stock-iii

题目描述

Say you have an array for which the i th 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).

解题思路： 这道题借鉴了别人的一些思想， 建立 b1， s1, b2, s2

其中b1表示第一次买入， s1表示第一次卖出； b2表示第二次买入， s2表示第二次卖出；

初始b1 = Integer.MIN_VALUE, b2 = Integer.MIN_VALUE;  s1 = s2 = 0;

遍历整个数组，然后对这四个值进行重新的比较

public class Solution {
  public int maxProfit(int[] prices) {
		int b1 = Integer.MIN_VALUE;
		int s1 = 0;
		int b2 = Integer.MIN_VALUE;
		int s2 = 0;
		for (int i = 0; i < prices.length; i++) {
			b1 = Math.max(b1, - prices[i]);
			s1 = Math.max(b1 + prices[i], s1);
			b2 = Math.max(b2, s1 - prices[i]);
			s2 = Math.max(b2 + prices[i], s2);
		}
		return s2;
	}
}