[LeetCode 5.25] Uncrossed Lines

Uncrossed Lines

We write the integers of A and B (in the order they are given) on two separate horizontal lines.

Now, we may draw connecting lines: a straight line connecting two numbers A[i] and B[j] such that:

• A[i] == B[j];
• The line we draw does not intersect any other connecting (non-horizontal) line.

Note that a connecting lines cannot intersect even at the endpoints: each number can only belong to one connecting line.

Return the maximum number of connecting lines we can draw in this way.

Example 1:

1  4  2
|   \
1  2  4
Input: A = [1,4,2], B = [1,2,4]
Output: 2
Explanation: We can draw 2 uncrossed lines as in the diagram.
We cannot draw 3 uncrossed lines, because the line from A[1]=4 to B[2]=4 will intersect the line from A[2]=2 to B[1]=2.

Example 2:

Input: A = [2,5,1,2,5], B = [10,5,2,1,5,2]
Output: 3
Example 3:

Input: A = [1,3,7,1,7,5], B = [1,9,2,5,1]
Output: 2

Note:

1. 1 <= A.length <= 500
2. 1 <= B.length <= 500
3. 1 <= A[i], B[i] <= 2000

Python3 Solution:

思路： 这题的本质相当于求最长公共子序列

class Solution:
    def maxUncrossedLines(self, A: List[int], B: List[int]) -> int:
        memo = [[-1]*len(B) for _ in range(len(A))]

        def helper(i, j):
            if i == -1 or j == -1:
                return 0
            if memo[i][j] != -1:                 
                return memo[i][j]            
            if A[i] == B[j]:
                memo[i][j] = helper(i-1, j-1) + 1
            else:
                memo[i][j] = max(helper(i-1, j), helper(i, j-1))
            return memo[i][j]

        return helper(len(A)-1, len(B)-1)