We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 43c83a7 commit 049a7fcCopy full SHA for 049a7fc
src/main/java/com/fishercoder/solutions/_718.java
@@ -1,22 +1,5 @@
1
package com.fishercoder.solutions;
2
3
-/**
4
- * 718. Maximum Length of Repeated Subarray
5
- *
6
- * Given two integer arrays A and B, return the maximum length of an subarray that appears in both arrays.
7
-
8
- Example 1:
9
- Input:
10
- A: [1,2,3,2,1]
11
- B: [3,2,1,4,7]
12
- Output: 3
13
14
- Explanation:
15
- The repeated subarray with maximum length is [3, 2, 1].
16
- Note:
17
- 1 <= len(A), len(B) <= 1000
18
- 0 <= A[i], B[i] < 100
19
- */
20
public class _718 {
21
public static class Solution1 {
22
public int findLength(int[] A, int[] B) {
0 commit comments