提示:文章写完后,目录可以自动生成,如何生成可参考右边的帮助文档
前言
`
一、力扣309.最佳买卖股票时机含冷冻期
class Solution {
public int maxProfit(int[] prices) {
if(prices == null || prices.length == 0){
return 0;
}
int n = prices.length;
int[][] dp = new int[n][4];
dp[0][0] = -prices[0];
for(int i = 1; i < n; i ++){//0持有,1,卖出, 2,冷静期,3不持有
dp[i][0] = Math.max(dp[i-1][0], Math.max(dp[i-1][2] - prices[i], dp[i-1][3]-prices[i]));
dp[i][1] = dp[i-1][0] + prices[i];
dp[i][2] = dp[i-1][1];
dp[i][3] = Math.max(dp[i-1][3], dp[i-1][2]);
}
return Math.max(dp[n-1][1], Math.max(dp[n-1][2], dp[n-1][3]));
}
}
二、力扣714.买卖股票的最佳时机含手续费
class Solution {
public int maxProfit(int[] prices, int fee) {
if(prices == null || prices.length == 0){
return 0;
}
int n = prices.length;
int[][] dp = new int[n][2];
dp[0][0] = -prices[0];
for(int i = 1; i < n; 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-1][0] + prices[i] - fee);
}
return Math.max(dp[n-1][0], dp[n-1][1]);
}
}