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 (i.e., you must sell the stock before you buy again).

Example 1:

Input: [3,3,5,0,0,3,1,4]
Output: 6
Explanation: Buy on day 4 (price = 0) and sell on day 6 (price = 3), profit = 3-0 = 3.
             Then buy on day 7 (price = 1) and sell on day 8 (price = 4), profit = 4-1 = 3.

Example 2:

Input: [1,2,3,4,5]
Output: 4
Explanation: Buy on day 1 (price = 1) and sell on day 5 (price = 5), profit = 5-1 = 4.
             Note that you cannot buy on day 1, buy on day 2 and sell them later, as you are
             engaging multiple transactions at the same time. You must sell before buying again.

Example 3:

Input: [7,6,4,3,1]
Output: 0
Explanation: In this case, no transaction is done, i.e. max profit = 0.

  股票交易，先买后卖，最多交易两次。采用动态规划的思路，将[1,n]划分成[1,i]和[i,n]两个区间，分别计算出这两个区间的最大收益，然后相加。记录整个区间[1,n]的最大收益，返回即可。

class Solution {
public:
    int maxProfit(vector<int>& prices) {
      int sum=0;
      for(int i=0; i<prices.size(); i++)
      {   
          int leftSum = maxSubProfit(prices,0,i);
          int rightSum = maxSubProfit(prices,i,prices.size());
          if(sum < leftSum + rightSum)
            sum =  leftSum + rightSum;
      }
      return sum;
    }
private:
    int maxSubProfit(vector<int>& prices,int left,int right) {
      if (prices.size() == 0 || left == right)
			return 0;

		int minNum = prices[left];
		int sum = 0;
		for (int i = left; i <= right && i<prices.size(); i++)
		{
			if (prices[i] < minNum)
				minNum = prices[i];

			if (prices[i] - minNum > sum)
				sum = prices[i] - minNum;
		}
		return sum;  
    }
};