刷题训练 day45 | 第九章 动态规划 part13

题目1：【二刷完成】

class Solution {
    public int lengthOfLIS(int[] nums) {
        int[] dp = new int[nums.length];
        for (int i=0;i<nums.length;i++){
            dp[i]=1;
        }
        //dp[0]=1;//以0为下标的最长子序列
        for (int i=1;i<nums.length;i++){
            for (int j=0;j<=i;j++){
                if (nums[i]>nums[j]){
                  dp[i]=Math.max(dp[j]+1,dp[i]);  
                }
            }
        }
        int result=0;
        for (int i=0;i<nums.length;i++){
            result=Math.max(result,dp[i]);
        }
        return result;
    }
}

题目2：【二刷完成】

class Solution {
    public int findLengthOfLCIS(int[] nums) {
        int[] dp = new int[nums.length];
         for (int i = 0; i < dp.length; i++) {
            dp[i] = 1;
        }
        int res = 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];
        }
        return res;
    }
}

题目3：【二刷完成】

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;
    }
}