最长重复子数组

def solve():
    def findLength(____):
        m, n = len(____), len(____)
        dp = [[____] * (____) for _ in range(____)]
        max_len = ____
        for i in range(____, m + ____):
            for j in range(____, n + ____):
                if nums1[i-____] == nums2[j-____]:
                    dp[i][j] = dp[i-____][j-____] + ____
                    max_len = max(____)
        return max_len
    print(findLength(____))