#718

Maximum Length of Repeated Subarray

specialist · 845 · lc medium +31 · verified · 51.3% accepted · 7,073 likes · top 40%

⚑ String Matching DP (LCS / Edit Distance)

Description

Given two integer arrays nums1 and nums2, find and return the length of the longest subarray that is common to both arrays (i.e., appears contiguously in each).

Example 1:

Input: nums1 = [1,2,3,2,1], nums2 = [3,2,1,4,7]

Output: 3

Explanation: The repeated subarray with maximum length is [3,2,1].

Example 2:

Input: nums1 = [0,0,0,0,0], nums2 = [0,0,0,0,0]

Output: 5

Explanation: The repeated subarray with maximum length is [0,0,0,0,0].

Code

1

2

3

class Solution:
    def findLength(self, nums1: List[int], nums2: List[int]) -> int:

class Solution:
    def findLength(self, nums1: List[int], nums2: List[int]) -> int: