# 718. Maximum Length of Repeated Subarray

#### Medium

***

Given two integer arrays `nums1` and `nums2`, return *the maximum length of a subarray that appears in **both** arrays*.

 

**Example 1:**

<pre><code>Input: nums1 = [1,2,3,2,1], nums2 = [3,2,1,4,7]
<strong>Output:
</strong> 3
<strong>Explanation:
</strong> The repeated subarray with maximum length is [3,2,1].
</code></pre>

**Example 2:**

<pre><code>Input: nums1 = [0,0,0,0,0], nums2 = [0,0,0,0,0]
<strong>Output:
</strong> 5
</code></pre>

&#x20;

**Constraints:**

* `1 <= nums1.length, nums2.length <= 1000`
* `0 <= nums1[i], nums2[i] <= 100`

```python
class Solution(object):
    def findLength(self, A, B):
        dp = [[0 for _ in range(len(B) + 1)] for _ in range(len(A) + 1)]
        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
        return max(max(row) for row in dp)
```