From e191a711adc93d2cb4fcdd5a779e0cdf12107e61 Mon Sep 17 00:00:00 2001
From: QuinnDK <39618652+QuinnDK@users.noreply.github.com>
Date: Mon, 17 May 2021 16:11:50 +0800
Subject: [PATCH] =?UTF-8?q?Update=200718.=E6=9C=80=E9=95=BF=E9=87=8D?=
 =?UTF-8?q?=E5=A4=8D=E5=AD=90=E6=95=B0=E7=BB=84.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0718.最长重复子数组.md | 21 +++++++++++++++++++++
 1 file changed, 21 insertions(+)

diff --git a/problems/0718.最长重复子数组.md b/problems/0718.最长重复子数组.md
index c20ea79f..f0f9a883 100644
--- a/problems/0718.最长重复子数组.md
+++ b/problems/0718.最长重复子数组.md
@@ -160,7 +160,28 @@ Python：
 
 
 Go：
+```Go
+func findLength(A []int, B []int) int {
+	m, n := len(A), len(B)
+	res := 0
+	dp := make([][]int, m+1)
+	for i := 0; i <= m; i++ { 
+		dp[i] = make([]int, n+1)
+	}
 
+	for i := 1; i <= m; i++ {
+		for j := 1; j <= n; 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
+}
+```