leetcode1035

 class Solution:
     def maxUncrossedLines(self, A: 'List[int]', B: 'List[int]') -> int:
         m = len(A)
         n = len(B)
         dp = [[0 for a in range(n+1)] for b in range(m+1)]
         for i in range(1,m+1):
             for j in range(1,n+1):
                 if A[i-1] == B[j-1]:
                     dp[i][j] = dp[i-1][j-1] + 1
                 else:
                     if dp[i][j-1] >= dp[i-1][j]:
                         dp[i][j] = dp[i][j-1]
                     else:
                         dp[i][j] = dp[i-1][j]
         return dp[m][n]

这道题的思路是，最长公共子序列LCS，典型的DP类型题目。我最怕的类型了。