LeetCode1035. 不相交的線

class Solution(object):
def maxUncrossedLines(self, A, B):
“”"
:type A: List[int]
:type B: List[int]
:rtype: int
“”"
# lenA, lenB = len(A), len(B)
# dp = [[0 for i in range(lenB + 1)] for j in range(lenA + 1)]
dp = [[0 for i in range(501)] for j in range(501)]
for i in range(1, lenA + 1):
for j in range(1, lenB + 1):
if A[i - 1] == B[j - 1]:
dp[i][j] = dp[i-1][j-1] + 1
else:
dp[i][j] = max(dp[i-1][j], dp[i][j-1])
return dp[i][j]