题解 | 公共子串计算
公共子串计算
https://www.nowcoder.com/practice/98dc82c094e043ccb7e0570e5342dd1b
a = input()
b = input()
na,nb = len(a),len(b)
dp = [[0]*(nb+1) for _ in range(na+1)]
for i in range(1,na+1):
for j in range(1,nb+1):
if a[i-1] == b[j-1]:
dp[i][j] = 1+dp[i-1][j-1]
print(max(max(dp[i]) for i in range(na+1)))
