【JAVA】188.买卖股票的最佳时机IV| 309.最佳买卖股票时机含冷冻期 | 300.最长递增子序列 |674. 最长连续递增序列-CSDN博客

本文链接：https://blog.csdn.net/Avery51N0W/article/details/138038149

class Solution {
    public int maxProfit(int k, int[] prices) {
        //[天数][操作第几次][买卖状态 0不持有 1 持有]
        int[][][] dp = new int[prices.length][2][2];
        //初始化
        dp[0][0][0] = 0;
        dp[0][0][1] = -prices[0];
        dp[0][1][0] = 0;
        dp[0][1][1] = -prices[0];
        for(int i = 1 ; i < prices.length ; i++){
            dp[i][0][1] = -prices[i];
            dp[i][0][0] = Math.max(dp[i - 1][0][1] + prices[i], dp[i-1][0][0]); 
            dp[i][1][1] = Math.max(dp[i - 1][0][0] - prices[i], dp[i-1][1][1]);
            dp[i][1][0] = Math.max(dp[i - 1][1][1] + prices[i], dp[i-1][1][0]);
        }
        return Math.max(dp[prices.length-1][0][0],dp[prices.length-1][1][0]);
    }
}

class Solution {
    public int maxProfit(int[] prices) {
        //[天数][买卖状态 0不持有 1 持有]
        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][3] - prices[i], dp[i - 1][1] - 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][3],Math.max(dp[prices.length-1][1],dp[prices.length-1][2]));
    }
}

class Solution {
    public int lengthOfLIS(int[] nums) {
        int len = nums.length;
        int[] dp = new int[len];
        int res = 1;
        Arrays.fill(dp, 1);
        for(int i = 1 ; i < len; i++){
            for(int j = 0; j < i; j++){
                if(nums[i] > nums[j]){
                    dp[i] = Math.max(dp[i], dp[j] + 1);
                }
            res=Math.max(res,dp[i]);
            }  
        }
        return res;

    }
}

class Solution {
    public int findLengthOfLCIS(int[] nums) {
        int len = nums.length;
        int[] dp = new int[len];
        int res = 1;
        Arrays.fill(dp, 1);
        for(int i = 1 ; i < len; i++){
            if(nums[i] > nums[i-1]){
                dp[i] = dp[i-1] +1;
            }
            res = Math.max(res,dp[i]);           
        }
        return res;

    }
}