经过不断地调试,敲出来了。利用动态编程的思想,DP;类似于组合数学上的动态递归;idea的灵感来源于:
https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-iv/solution/yi-ge-tong-yong-fang-fa-tuan-mie-6-dao-gu-piao-w-5/
Code:
class Solution {
public int maxProfit(int max_k, int[] prices) {
int n=prices.length;
if(max_k>n/2)
return maxProfit_k_inf(prices);
int [][][] dp=new int[n][max_k+1][2];
for(int i=0;i<n;i++){
dp[i][0][0]=0;
for(int k=max_k;k>=1;k--){
if(i-1==-1){
dp[i][k][0]=0;
dp[i][k][1]=-prices[0];
continue;
}
dp[i][k][0]=Math.max(dp[i-1][k][0],dp[i-1][k][1]+prices[i]);
dp[i][k][1]=Math.max(dp[i-1][k][1],dp[i-1][k-1][0]-prices[i]);
}
}
return dp[n-1][max_k][0];
}
public int maxProfit_k_inf(int[] prices){
int n=prices.length;
int dp_mia_0=0,dp_mia_1=Integer.MIN_VALUE;
for(int i=0;i<n;i++){
int temp=dp_mia_0;
dp_mia_0=Math.max(dp_mia_0,dp_mia_1+prices[i]);
dp_mia_1=Math.max(dp_mia_1,temp-prices[i]);
}
return dp_mia_0;
}
}