Class Solution
java.lang.Object
g0701_0800.s0718_maximum_length_of_repeated_subarray.Solution
718 - Maximum Length of Repeated Subarray.<p>Medium</p>
<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><strong>Example 1:</strong></p>
<p><strong>Input:</strong> nums1 = [1,2,3,2,1], nums2 = [3,2,1,4,7]</p>
<p><strong>Output:</strong> 3</p>
<p><strong>Explanation:</strong> The repeated subarray with maximum length is [3,2,1].</p>
<p><strong>Example 2:</strong></p>
<p><strong>Input:</strong> nums1 = [0,0,0,0,0], nums2 = [0,0,0,0,0]</p>
<p><strong>Output:</strong> 5</p>
<p><strong>Constraints:</strong></p>
<ul>
<li><code>1 <= nums1.length, nums2.length <= 1000</code></li>
<li><code>0 <= nums1[i], nums2[i] <= 100</code></li>
</ul>
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
Solution
public Solution()
-
-
Method Details
-
findLength
public int findLength(int[] nums1, int[] nums2)
-