代码随想录算法训练营第五十三天｜1143.最长公共子序列 1035.不相交的线 53. 最大子序和

1143.最长公共子序列

https://leetcode.com/problems/longest-common-subsequence/

思路： longest common subsequence 是动态规划中的经典问题。 记住 如果 str1[i] == str2[j] dp[i+1][j+1]= dp[i][j] + 1, 不等的话 dp[i+1][j+1]  = max(dp[i][j+1], dp[i+1][j]).

难点： 无

class Solution:
    def longestCommonSubsequence(self, text1: str, text2: str) -> int:
        dp = [[0] * (len(text1) + 1) for _ in range(len(text2)+1)]
        for i in range(1, len(text2)+1):
            for j in range(1, len(text1)+1):
                if text2[i-1] == text1[j-1]:
                    dp[i][j] = dp[i-1][j-1] + 1
                else:
                    dp[i][j] = max(dp[i-1][j], dp[i][j-1])
        return dp[-1][-1]        

1035.不相交的线  

https://leetcode.com/problems/uncrossed-lines/description/

思路： 不相交的线等价于就是找到 longest common subsequence。 

难点： 思路的转换

class Solution:
    def maxUncrossedLines(self, nums1: List[int], nums2: List[int]) -> int:
        dp = [[0] * (len(nums1) + 1) for _ in range(len(nums2) + 1)]
        for i in range(1, len(nums2)+1):
            for j in range(1, len(nums1)+1):
                if nums1[j-1] == nums2[i-1]:
                    dp[i][j] = dp[i-1][j-1] + 1
                else:
                    dp[i][j] = max(dp[i][j-1], dp[i-1][j])
        return dp[-1][-1]
        

53. 最大子序和

https://leetcode.com/problems/maximum-subarray/description/

思路： 之前用贪心算法做过的问题， 用动态规划重新做一遍， 定义dp 数组的元素 dp[i] 是包以nums[i-1] 结尾并包含了nums[i-1] 的最大子序列和。dp[0] = 0. 递推关系就是 dp[i] = max(nums[i-1], dp[i-1]+nums[i-1]. 最后返回dp 数组中除了第一个元素外最大的值。 

难点： 无

class Solution:
    def maxSubArray(self, nums: List[int]) -> int:
        dp = [0 for _ in range(len(nums)+1)]
        for i in range(1, len(nums)+1):
            dp[i] = max(dp[i-1] + nums[i-1], nums[i-1])
        return max(dp[1:])