maximum_length_of_repeated_subarray

package
v1.4.6 Latest Latest
Warning

This package is not in the latest version of its module.

Go to latest
Published: Sep 14, 2019 License: MIT Imports: 0 Imported by: 0

README

< Previous                  Next >

718. Maximum Length of Repeated Subarray (Medium)

Given two integer arrays A and B, return the maximum length of an subarray that appears in both arrays.

Example 1:

Input:
A: [1,2,3,2,1]
B: [3,2,1,4,7]
Output: 3
Explanation: 
The repeated subarray with maximum length is [3, 2, 1].

 

Note:

  1. 1 <= len(A), len(B) <= 1000
  2. 0 <= A[i], B[i] < 100

 

[Array] [Hash Table] [Binary Search] [Dynamic Programming]

Similar Questions

  1. Minimum Size Subarray Sum (Medium)

Hints

Hint 1 Use dynamic programming. dp[i][j] will be the answer for inputs A[i:], B[j:].

Documentation

The Go Gopher

There is no documentation for this package.

Jump to

Keyboard shortcuts

? : This menu
/ : Search site
f or F : Jump to
y or Y : Canonical URL