代码随想录二刷day53

提示：文章写完后，目录可以自动生成，如何生成可参考右边的帮助文档

---

前言

---

一、力扣1143. 最长公共子序列

class Solution {
    public int longestCommonSubsequence(String text1, String text2) {
        int[][] dp = new int[text1.length()+1][text2.length()+1];
        for(int i = 1; i < text1.length()+1; i ++){
            for(int j = 1; j < text2.length()+1; j ++){
                if(text1.charAt(i-1) == text2.charAt(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[text1.length()][text2.length()];
    }
}

二、力扣1035. 不相交的线

class Solution {
    public int maxUncrossedLines(int[] nums1, int[] nums2) {
        int row = nums1.length+1;
        int col = nums2.length+1;
        int[][] dp = new int[row][col];
        for(int i = 1; i < row; i ++){
            for(int j = 1; j < col; 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]);
                }
            }
        }
        
        return dp[row-1][col-1];
    }
}

三、力扣53. 最大子数组和

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