问题:
难度:easy
问题链接:https://leetcode.com/problems/uncrossed-lines/
相关算法:
最长子序列:https://blog.csdn.net/qq_28033719/article/details/105727258
硬币和背包:https://blog.csdn.net/qq_28033719/article/details/106501253
说明:
给数组 A B,将两个数组进行相同元素连线,每个元素只能连一次,然后算出两个数组之间最多连接多少条线,其实就一个dp。
输入案例
样本1如图
Example 1:
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