LeetCode力扣之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).

package leetCode;

/**
 * Created by lxw, liwei4939@126.com on 2018/3/25.
 */
public class L123_BestTimeBuySellStock {

    /*
    假设最初没有钱，buy1意味着尽可能借最少的钱购买股票，sell1表示决定卖股票，卖价为price[i], 然后还账
    剩下的钱为sell1 = price[i] - |buy1| = price[i]+buy1, 使该值最大化
    buy2表示买第2张股票，之后还剩余的钱为buy2 = sell1 - price[i], 想使剩下的钱最多，因此最大化该值
    sell2表示卖掉股票2，卖价为price[i], 剩余的钱数为sell2 = buy2 + price[i], 使该值最大化
    最后剩下的sell2即是所求解
    * */
    public int maxProfit(int[] prices){
        int sell1 = 0, sell2 = 0, buy1 = Integer.MIN_VALUE, buy2 = Integer.MIN_VALUE;

        for (int i = 0; i < prices.length; i++){
            buy1 = Math.max(buy1, -prices[i]);
            sell1 = Math.max(sell1, buy1 + prices[i]);
            buy2 = Math.max(buy2, sell1-prices[i]);
            sell2 = Math.max(sell2, buy2 + prices[i]);
        }
        return sell2;
    }
}