LeetCode188.买卖股票的最佳时机IV
public int maxProfit(int k, int[] prices) {
// dp数组含义:0为无状态,1为持有,2为不持有
int[][] dp = new int[prices.length][2 * k + 1];
// 初始化
for (int j = 1; j < 2 * k; j += 2) {
dp[0][j] = -prices[0];
}
for (int i = 1; i < prices.length; i++) {
for (int j = 0; j < 2 * k - 1; j += 2) {
dp[i][j + 1] = Math.max(dp[i - 1][j + 1], dp[i - 1][j] - prices[i]);
dp[i][j + 2] = Math.max(dp[i - 1][j + 2], dp[i - 1][j + 1] + prices[i]);
}
}
return dp[prices.length - 1][2 * k];
}
LeetCode309.最佳买卖股票时机含冷冻期
public int maxProfit(int[] prices) {
//dp数组含义:0为持有该股票,1为不持有该股票 2今天卖出 3冷冻
int[][] dp = new int[prices.length][4];
dp[0][0]=-prices[0];
dp[0][1]=0;
dp[0][2]=0;
dp[0][3]=0;
for(int i=1;i<prices.length;i++) {
dp[i][0]=Math.max(dp[i-1][0],Math.max(dp[i-1][1],dp[i-1][3])-prices[i]);
dp[i][1]=Math.max(dp[i-1][1], dp[i-1][3]);
dp[i][2]=dp[i-1][0]+prices[i];
dp[i][3]=dp[i-1][2];
}
return Math.max(dp[prices.length-1][1], Math.max(dp[prices.length-1][2], dp[prices.length-1][3]));
}
LeetCode714.买卖股票的最佳时机含手续费
public int maxProfit(int[] prices, int fee) {
//dp数组含义:0为持有该股票,1为不持有该股票
int[][] dp = new int[prices.length][2];
dp[0][0]=-prices[0];
dp[0][1]=0;
for(int i=1;i<prices.length;i++) {
dp[i][0]=Math.max(dp[i-1][0], dp[i-1][1]-prices[i]);
dp[i][1]=Math.max(dp[i-1][1], dp[i][0]+prices[i]-fee);
}
return dp[prices.length-1][1];
}