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

要求：同上题
思路：同上题

class Solution {
public:
    int maxProfit(int k, vector<int>& prices) {
        int n=prices.size();
        if(n<=1)return 0;
        vector<vector<int>> buy(n,vector<int>(k+1));
        vector<vector<int>> sell(n,vector<int>(k+1));
        for(int i=1;i<=k;++i)
            buy[0][i]=-prices[0];
        for(int i=1;i<n;++i){
            for(int j=1;j<=k;++j){
                buy[i][j]=max(buy[i-1][j],sell[i-1][j-1]-prices[i]);
                sell[i][j]=max(sell[i-1][j],buy[i-1][j]+prices[i]);
            }
        }
        return sell[n-1][k];
    }
};