Leetcode之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.

代码：

class Solution {
public:
    int maxProfit(vector<int>& prices) {
       int m = prices.size();
        if(m == 0)
            return 0;
        
        int ret = 0;
        vector<int> forw(m, 0);
        vector<int> back(m, 0);
        
        //forward
        int curMin = prices[0];
        for(int i = 1; i < m; i  ++)
        {
            curMin = min(curMin, prices[i]);
            forw[i] = max(forw[i-1], prices[i]-curMin);
        }
        //backward
        int curMax = prices[m-1];
        for(int i = m-2; i >= 0; i --)
        {
            curMax = max(curMax, prices[i]);
            back[i] = min(back[i+1], prices[i]-curMax);
            
            ret = max(ret, forw[i]-back[i]);
        }
        
        return ret;
    }
};

想法：动态规划