188. Best Time to Buy and Sell Stock IV

You are given an integer array prices where prices[i] is the price of a given stock on the ith day.

Design an algorithm to find the maximum profit. You may complete at most k transactions.

Notice that you may not engage in multiple transactions simultaneously (i.e., you must sell the stock before you buy again).

 

Example 1:

Input: k = 2, prices = [2,4,1]
Output: 2
Explanation: Buy on day 1 (price = 2) and sell on day 2 (price = 4), profit = 4-2 = 2.
Example 2:

Input: k = 2, prices = [3,2,6,5,0,3]
Output: 7
Explanation: Buy on day 2 (price = 2) and sell on day 3 (price = 6), profit = 6-2 = 4. Then buy on day 5 (price = 0) and sell on day 6 (price = 3), profit = 3-0 = 3.
 

Constraints:

0 <= k <= 109
0 <= prices.length <= 1000
0 <= prices[i] <= 1000

思路未优化

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

优化 

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

只要n/2次达到无限次操作

class Solution {
public:
    int maxProfit(int k, vector<int>& prices) 
    {
        int n=prices.size();
        if(n==0) return 0;
        if(k>n/2)
        {
            int dp=0;//卖出得到的收益
            int dp1= -prices[0];//买入得到收益
            for (int i = 1; i < prices.size(); i++)
            {
                dp = max(dp,dp1 + prices[i]);
                dp1 = max(dp1,dp - prices[i]);
            }
            return max(dp, dp1);
        }
        vector<int> local(k+1,0);
        vector<int> global(k+1,0);
        for(int i=1;i<n;i++){
            int diff=prices[i]-prices[i-1];
            vector<int> temp(k+1,0);
            for(int j=1;j<=k;j++){
                local[j]=max(global[j-1],local[j])+diff;
                temp[j]=max(global[j],local[j]);
            }
            global=temp;
           
        }
         return global[k];
    }
};