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

解题思路：
十分简短精炼的题了..
由于最多进行两次交易，那么考虑保存交易完成后的每个状态。
那么一共有n*5种状态（令天数为n）每一天都可能是还未购买过，第一次购买，第一次出售，第二次购买，第二次出售。由于第一种状态在每一天都相同，故不加入考虑。
于是用数组profit[i][j]来储存第i天在状态j时的最大收益。
则profit[i][j]与profit[i-1][j], profit[i-1][j-1]和prices[i]有关。
完成后发现每天的状态只和前一天有关，实际上不需要用数组储存更早的状态。
故将空间复杂度缩减为O(1)。

具体实现：

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        int n = prices.size();
        if (n == 0) return 0;

        int max0, max1, max2, max3;
        max1 = max3 = 0;
        max0 = max2 = -prices[0];

        for (int i = 1; i < n; i++) {
            max0 = (-prices[i] > max0) ? -prices[i] : max0;
            max1 = (max0 + prices[i] > max1) ? (max0 + prices[i]) : max1;
            max2 = (max1 - prices[i] > max2) ? (max1 - prices[i]) : max2;
            max3 = (max2 + prices[i] > max3) ? (max2 + prices[i]) : max3;
        }
        return max3;
    }
};

提交结果：

198 / 198 test cases passed.
Status: Accepted
Runtime: 6 ms
Your runtime beats 32.60 % of cpp submissions.