✨ Add solution and testcases to problem 718

Author: Cori1109

leetcode/701-800/0718.Maximum-Length-of-Repeated-Subarray/README.md

@@ -1,15 +1,21 @@
 # [718.Maximum Length of Repeated Subarray][title]
 
-> [!WARNING|style:flat]
-> This question is temporarily unanswered if you have good ideas. Welcome to [Create Pull Request PR](https://github.com/kylesliu/awesome-golang-algorithm)
-
 ## Description
 
+Given two integer arrays `nums1` and `nums2`, return _the maximum length of a subarray that appears in **both** arrays_.
+
 **Example 1:**
 
 ```
-Input: a = "11", b = "1"
-Output: "100"
+Input: nums1 = [1,2,3,2,1], nums2 = [3,2,1,4,7]
+Output: 3
+```
+
+**Example 2:**
+
+```
+Input: nums1 = [0,0,0,0,0], nums2 = [0,0,0,0,0]
+Output: 5
 ```
 
 ## 题意

leetcode/701-800/0718.Maximum-Length-of-Repeated-Subarray/Solution.go

@@ -1,5 +1,23 @@
 package Solution
 
-func Solution(x bool) bool {
-	return x
+func Solution(nums1 []int, nums2 []int) int {
+    n, m := len(nums1), len(nums2);
+    dp := make([]int, m + 1);
+    res := 0;
+    for i := 1; i < n + 1; i++ {
+        for j := m; j > 0; j-- {
+            if nums1[i - 1] == nums2[j - 1] {
+                dp[j] = 1 + dp[j - 1];
+            } else {
+                dp[j] = 0;
+            }
+            res = max(res, dp[j])
+        }
+    }
+    return res;
+}
+
+func max(v1, v2 int) int {
+    if v1 > v2 { return v1; }
+    return v2;
 }

leetcode/701-800/0718.Maximum-Length-of-Repeated-Subarray/Solution_test.go

@@ -10,21 +10,22 @@ func TestSolution(t *testing.T) {
 	//	测试用例
 	cases := []struct {
 		name   string
-		inputs bool
-		expect bool
+		nums1  []int
+		nums2  []int
+		expect int
 	}{
-		{"TestCase", true, true},
-		{"TestCase", true, true},
-		{"TestCase", false, false},
+		{"TestCase", []int{1,2,3,2,1}, []int{3,2,1,4,7}, 3},
+		{"TestCase", []int{0,0,0,0,0}, []int{0,0,0,0,0}, 5},
+		{"TestCase", []int{0,0,0,0,1}, []int{1,0,0,0,0}, 4},
 	}
 
 	//	开始测试
 	for i, c := range cases {
 		t.Run(c.name+" "+strconv.Itoa(i), func(t *testing.T) {
-			got := Solution(c.inputs)
+			got := Solution(c.nums1, c.nums2)
 			if !reflect.DeepEqual(got, c.expect) {
-				t.Fatalf("expected: %v, but got: %v, with inputs: %v",
-					c.expect, got, c.inputs)
+				t.Fatalf("expected: %v, but got: %v, with inputs: %v %v",
+					c.expect, got, c.nums1, c.nums2)
 			}
 		})
 	}