[最大最长]最长公共子数组

class Solution:
    def findLength(self, nums1: List[int], nums2: List[int]) -> int:

        n = len(nums1)
        m = len(nums2)

        dp = [[0] * (m + 1) for _ in range(n + 1)]
        res = 0
        for i in range(1, n + 1):
            for j in range(1, m + 1):
                if nums1[i - 1] == nums2[j - 1]:
                    dp[i][j] = dp[i - 1][j - 1] + 1
                    res = max(res, dp[i][j])

        return res