<p>Given two integer arrays <code>nums1</code> and <code>nums2</code>, return <em>the maximum length of a subarray that appears in <strong>both</strong> arrays</em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> 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].
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> nums1 = [0,0,0,0,0], nums2 = [0,0,0,0,0]
<strong>Output:</strong> 5
<strong>Explanation:</strong> The repeated subarray with maximum length is [0,0,0,0,0].
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= nums1.length, nums2.length &lt;= 1000</code></li>
	<li><code>0 &lt;= nums1[i], nums2[i] &lt;= 100</code></li>
</ul>

class Solution:
    def findLength(self, nums1: List[int], nums2: List[int]) -> int:
        n=len(nums1)
        m=len(nums2)
        dp=[[0 for _ in range(m)] for _ in range(n)]
        continuity=[[0 for _ in range(m)] for _ in range(n)]
        S=[[0 for _ in range(m)] for _ in range(n)]
        """
        [1,3]
        [1,4,3]
        """
        for i in range(m):
            if(nums1[n-1]==nums2[i]):
                dp[n-1][i]=1
                continuity[n-1][i]=1
                S[n-1][i]=1
            #print(f"dp[{n-1}][{i}]={dp[n-1][i]}")
        for i in range(n):
            if(nums1[i]==nums2[m-1]):
                dp[i][m-1]=1
                S[i][m-1]=1
                continuity[i][m-1]=1
            #print(f"dp[{i}][{m-1}]={dp[i][m-1]}")
        for i in range(n-2,-1,-1):
            for j in range(m-2,-1,-1):
                if(nums1[i]==nums2[j]):
                    continuity[i][j]=1
                    S[i][j]=1+S[i+1][j+1]
                    if(continuity[i+1][j+1]==1):
                        dp[i][j]=max(S[i][j],dp[i+1][j],dp[i][j+1])
                    else:
                        """if(continuity[i+1][j]==1):
                            dp[i][j]=max(dp[i][j],dp[i+1][j])
                        elif(continuity[i][j+1]==1):
                            dp[i][j]=max(dp[i][j],dp[i][j+1])
                        else:
                            dp[i][j]=1"""
                        dp[i][j]=max(1,dp[i][j+1],dp[i+1][j])
                else:
                    dp[i][j]=max(dp[i+1][j],dp[i][j+1])
                #print(f"dp[{i}][{j}]={dp[i][j]}")
        return dp[0][0]
        
59800