We write the integers of
B (in the order they are given) on two separate horizontal lines.
Now, we may draw a straight line connecting two numbers
B[j] as long as
A[i] == B[j], and the line we draw does not intersect any other connecting (non-horizontal) line.
Return the maximum number of connecting lines we can draw in this way.
Input: A = [1,4,2], B = [1,2,4]
Input: A = [2,5,1,2,5], B = [10,5,2,1,5,2]
Input: A = [1,3,7,1,7,5], B = [1,9,2,5,1]
1 <= A.length <= 500
1 <= B.length <= 500
1 <= A[i], B[i] <= 2000