add solution for maximum-length-of-repeated-subarray

Author: freefcw

go/maximum-length-of-repeated-subarray.go

@@ -0,0 +1,23 @@
+package leetcode
+
+func findLength(A []int, B []int) int {
+	rec := make([][]int, len(A)+1)
+	for i := 0; i < len(A)+1; i++ {
+		rec[i] = make([]int, len(B)+1)
+	}
+
+	max := 0
+	endA := len(A) - 1
+	endB := len(B) - 1
+	for i := endA; i >= 0; i-- {
+		for j := endB; j >= 0; j-- {
+			if B[j] == A[i] {
+				rec[i][j] = rec[i+1][j+1] + 1
+				if rec[i][j] > max {
+					max = rec[i][j]
+				}
+			}
+		}
+	}
+	return max
+}

go/maximum-length-of-repeated-subarray_test.go

@@ -0,0 +1,36 @@
+package leetcode
+
+import "testing"
+
+func TestFindLength(t *testing.T) {
+	tests := []struct {
+		a      []int
+		b      []int
+		expect int
+	}{
+		{
+			a:      []int{1, 2, 3, 2, 1},
+			b:      []int{3, 2, 1, 4, 7},
+			expect: 3,
+		}, {
+			a:      []int{1, 4, 7, 2, 1},
+			b:      []int{3, 2, 1, 4, 7},
+			expect: 3,
+		}, {
+			a:      []int{1},
+			b:      []int{2},
+			expect: 0,
+		}, {
+			a:      []int{2},
+			b:      []int{2},
+			expect: 1,
+		},
+	}
+
+	for i, item := range tests {
+		actual := findLength(item.a, item.b)
+		if actual != item.expect {
+			t.Fatalf("%d expect %d, actual %d\n", i, item.expect, actual)
+		}
+	}
+}