------
## 最终结论
```python
def findLength(A, B):
    dp = [[0] * (len(B) + 1) for _ in range(len(A) + 1)]
    max_len = 0
    for i in range(1, len(A) + 1):
        for j in range(1, len(B) + 1):
            if A[i - 1] == B[j - 1]:
                dp[i][j] = dp[i - 1][j - 1] + 1
                max_len = max(max_len, dp[i][j])
            else:
                dp[i][j] = 0
    return max_len
```