LeetCode42● 309.最佳买卖股票时机含冷冻期 ● 714.买卖股票的最佳时机含手续费

309.最佳买卖股票时机含冷冻期

力扣题目链接

class Solution {
    public int maxProfit(int[] prices) {
        //dp[i][0] 买入
        //dp[i][1] 卖出
        //dp[i][2] 今天卖出
        //dp[i][3] 冷冻期

        //dp[i][0] = Math.max(dp[i - 1][0],dp[i - 1][1] - prices[i],dp[i - 1][3] - prices);
        //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];

        //初始化
        //dp[0][0] = -prices[0];
        //dp[0][1] = 0;
        //dp[0][2] = 0;
        //dp[0][3] = 0;
        
        int len = prices.length;
        int[][] dp = new int[len][4];
        dp[0][0] = -prices[0];
        
        for(int i = 1;i < len;i++){
            dp[i][0] = Math.max(dp[i - 1][0],dp[i - 1][1] - prices[i]);
            dp[i][0] = Math.max(dp[i][0],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];
        }
        int max = 0;
        max = dp[len - 1][1] > dp[len - 1][2] ? dp[len - 1][1] : dp[len - 1][2];
        max = max > dp[len - 1][3] ? max : dp[len - 1][3];
        return max;
    }
}

714.买卖股票的最佳时机含手续费

力扣题目链接

class Solution {
    public int maxProfit(int[] prices, int fee) {
        //dp[i][0] 第i天没有股票的钱
        //dp[i][1] 第i天持有股票的钱

        //dp[i][0] = Math.max(dp[i - 1][0],dp[i - 1][1] + prices[i] - fee);
        //dp[i][1] = Math.max(dp[i - 1][1],dp[i - 1][0] - prices]
        
        

        int len = prices.length;
        int[][] dp = new int[len][2];
        dp[0][1] = -prices[0];
        
        for(int i = 1;i < len;i++){                
            dp[i][0] = Math.max(dp[i - 1][0],dp[i - 1][1] + prices[i] - fee);
            dp[i][1] = Math.max(dp[i - 1][1],dp[i - 1][0] - prices[i]);
        }
        return dp[len - 1][0];

    }
}