代码随想录day40

一、最长递增子序列（LeetCode300）

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

二、最长连续递增序列（LeetCode674）

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

三、最长重复子数组（LeetCode718）

class Solution {
    public int findLength(int[] nums1, int[] nums2) {
        int result = 0;
        int[][] dp = new int[nums1.length + 1][nums2.length + 1];
        for (int i = 1; i < nums1.length + 1; i++) {
            for (int j = 1; j < nums2.length + 1; j++) {
                if (nums1[i - 1] == nums2[j - 1]) {
                    dp[i][j] = dp[i - 1][j - 1] + 1;
                    result = Math.max(result, dp[i][j]);
                }
            }
        }
        return result;
    }
}

DP滚动数组

class Solution {
    // 滚动数组
    public int findLength(int[] nums1, int[] nums2) {
        int[] dp = new int[nums2.length + 1];
        int result = 0;
        for (int i = 1; i <= nums1.length; i++) {
            for (int j = nums2.length; j > 0; j--) {
                if (nums1[i - 1] == nums2[j - 1]) {
                    dp[j] = dp[j - 1] + 1;
                } else {
                    dp[j] = 0;
                }
                result = Math.max(result, dp[j]);
            }
        }
        return result;
    }
}