用动态规划
class Solution(object):
def findLength(self, A, B):
"""
:type A: List[int]
:type B: List[int]
:rtype: int
"""
LENA = len(A)
LENB = len(B)
mat = [[0]*(LENB+1) for _ in range(LENA+1)]
for i in range(1,LENA+1):
for j in range(1,LENB+1):
if A[i-1] == B[j-1]:
mat[i][j] = mat[i-1][j-1]+1
return max([max(line) for line in mat])