123. Best Time to Buy and Sell Stock III Hard

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).

思路：本题用动态规划可以很好的减少时间复杂度。注意题目说一个人最大可以投资2次，所以我们认为投资就进行了两次，即使是一次投资交易最大，我们也将其分为两次投资，这样容易得出一般规律。一次投资我们从第一天到最后一天找出每一天的最大利润，第二次投资我们从最后一天开始向前找每一天的最大利润，这样达到总共投资两次的思路，去两次相加的最大值来获得最大利润。

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        if (prices.size() <= 1) {
            return 0;
        }
        int tran1[prices.size()] = {0};
        int tran2[prices.size()] = {0};
        int min1 = prices[0];
        for (int i = 1; i < prices.size(); i++) {
            min1 = min(min1, prices[i]);
            tran1[i] = max(tran1[i - 1], prices[i] - min1);
        }
        int max1 = prices[prices.size() - 1];
        for (int i = prices.size() - 2; i >= 0; i--) {
            max1 = max(max1, prices[i]);
            tran2[i] = max(tran2[i + 1], max1 - prices[i]);
        }
        int global = 0;
        for (int i = 0; i < prices.size(); i++) {
            global = max(global, tran1[i] + tran2[i]);
        }
        return global;
    }
};