Solution of Maximum Length of Repeated Subarray

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 <= len(A), len(B) <= 1000
0 <= A[i], B[i] < 100

Ideas of solving a problem

Initialize the two-dimensional array, check according to the typical two-dimensional DP, take out the results, and determine the maximum value. The time complexity is O(n^2). And the space complexity is O(n^2).

code

package main

import (
	"fmt"
)

func main() {
	var A[] int
	var B[] int
	A=append(A,0,0,0,0,0,0,1,0,0,0)
	B=append(B,0,0,0,0,0,0,0,1,0,0)
	var answer int
	answer=findLength(A,B)
	fmt.Println(answer)
}

func findLength(A []int, B []int) int {
	res:=0
	dp:=make([][]int, len(A)+1)
	for i:=0;i< len(dp);i++{
		x:=make([]int, len(B)+1)
		dp[i]=x
	}
	for i:=1;i<= len(A);i++{
		for j:=1;j<= len(B);j++{
			if A[i-1]==B[j-1]{
				dp[i][j]=dp[i-1][j-1]+1
			}
			if dp[i][j]>res{
				res=dp[i][j]
			}
		}
	}
	return res
}

Output:

Code source: leetcode