Leetcode 188. 买卖股票的最佳时机 IV

动态规划，参考博客 https://blog.csdn.net/danielrichard/article/details/75091410
规划方程：
今天第x次买入状态的最大收入=max(昨天第x次买入状态的最大收入+0【今天不卖】,昨天第x-1次卖出状态的最大收入+今天的股票价格【今天买入】)
今天第x次卖出状态的最大收入=max(昨天第x次卖出状态的最大收入-0【今天不买】,昨天第x-1次买入状态的最大收入-今天的股票价格【今天卖出】)

class Solution {
public:
    int maxProfit(int k, vector<int>& prices) {
        vector<int> P;
        if (prices.empty() || k == 0) return 0;
        int l = prices[0], r = 0, xx = 0;
        for (int i = 1; i < prices.size(); ++i) {
            if (prices[i] < r) P.push_back(l), P.push_back(r), xx += r - l, l = prices[i], r = 0;
            else l = min(l, prices[i]), r = max(r, prices[i]);
        }
        if (r) P.push_back(l), P.push_back(r), xx += r - l;
        if (P.empty()) return 0;
        int n = P.size(), M;
        if (k >= n / 2) return xx;
        vector<int> sell(k + 1, 0), buy(k + 1, -0x3f3f3f3f);//代表当天第k次sell/buy状态时，当天为止的收入
        for (int day = 0; day < n; ++day) {
            for (int i = k; i>0; --i)
                buy[i] = max(buy[i], sell[i - 1] - P[day]), sell[i] = max(sell[i], buy[i] + P[day]);
        }
        return sell[k];
    }
};