1
class Solution:
2
    def maxUncrossedLines(self, nums1: List[int], nums2: List[int]) -> int:
3

4
        @lru_cache(None)
5
        def dp(a, b):
6
            if a >= len(nums1) or b >= len(nums2):
7
                return 0
8
            if nums1[a] == nums2[b]:
9
                return 1 + dp(a + 1, b + 1)
10
            else:
11
                return max(dp(a + 1, b), dp(a, b + 1))
12

13
        return dp(0, 0)