Day 53 | 1143. Longest Common Subsequence | 1035. Uncrossed Lines | 53. Maximum Subarray

王锴KKKKKKyle

已于 2023-08-16 23:18:24 修改

阅读量66

点赞数

分类专栏： LeetCode 文章标签： java leetcode 算法

于 2023-08-03 17:59:56 首次发布

本文链接：https://blog.csdn.net/kyle313606922/article/details/132080167

版权

LeetCode 专栏收录该内容

52 篇文章 0 订阅

订阅专栏

1143. Longest Common Subsequence

Question Link

class Solution {
    public int longestCommonSubsequence(String text1, String text2) {
        char[] char1 = text1.toCharArray();
        char[] char2 = text2.toCharArray();
        int[][] dp = new int[text1.length() + 1][text2.length() + 1];
        for(int i = 1; i <= char1.length; i++){
            for(int j = 1; j <= char2.length; j++){
                if(char1[i-1]==char2[j-1])
                    dp[i][j] = dp[i-1][j-1] + 1;
                else
                    dp[i][j] = Math.max(dp[i-1][j], dp[i][j-1]);
            }
        }
        return dp[char1.length][char2.length];
    }
}

dp[i][j]: The longest common subsequence of text1 whose length is [0, i-1] and text2 whose length is [0, j-1].
Recursive Formula
- text1[i-1] is the same as the text[j-1]
  - dp[i][j] = dp[i-1][j-1] + 1
- text[i-1] is not the same as the text[j-1]
  - Math.max(dp[i-1][j], dp[i][j-1])
The longest common subsequence of empty strings is 0, so dp[i][0] and dp[0][j] should be initialized to 0

1035. Uncrossed Lines

Question Link

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

In this question, the maximum number of connecting lines is same like 1143. Longest Common Subsequence.

53. Maximum Subarray

Question Link

class Solution {
    public int maxSubArray(int[] nums) {
        int[] dp = new int[nums.length];
        dp[0] = nums[0];
        int sum = nums[0];
        for(int i = 1; i < nums.length; i++){
            dp[i] = Math.max(dp[i-1] + nums[i], nums[i]);
            sum = Math.max(sum, dp[i]);
        }
        return sum;
    }
}

dp[i]: The largest sum of the subarray(include nums[i]) of nums
Recursive Formula
- 1、Add nums[i] to the previous sum
- 2、Calculate sum from nums[i]
- dp[i] = Math.max(dp[i-1] + nums[i], nums[i]);
According to the recursive formula, dp[i] depends on dp[i-1]. So dp[0] should be initialized to nums[0].

王锴KKKKKKyle

关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
Day 53 | 1143. Longest Common Subsequence | 1035. Uncrossed Lines | 53. Maximum Subarray

Day 53 | 1143. Longest Common Subsequence | 1035. Uncrossed Lines | 53. Maximum Subarray
复制链接

扫一扫