int maxProfit(int k, vector<int>& prices) {
if(prices.size()==0) {
return 0;
} else if(k>=prices.size()) {
return solveMaxProfit(prices);
}
int global[k+1]={0};
int local[k+1]={0};
for(int i=1;i<prices.size();i++) {
int diff=prices[i]-prices[i-1];
for(int j=k;j>=1;j--) {
local[j]=max(global[j-1]+max(0,diff),local[j]+diff);
global[j]=max(global[j],local[j]);
}
}
return global[k];
}
int maxProfit(int k, vector<int> &prices)
{
if(prices.empty() || k == 0)
return 0;
if(k >= prices.size())
return solveMaxProfit(prices);
vector<int> global(k + 1, 0);
vector<int> local(k + 1, 0);
for(int i = 1; i < prices.size(); i++)
{
int diff = prices[i] - prices[i - 1];
for(int j = k; j >= 1; j--)
{
local[j] = max(local[j] + diff, global[j - 1] + max(diff, 0));
global[j] = max(global[j], local[j]);
}
}
return global[k];
}