From c628620ceddbdbe236b1cbb6cc597431642ae260 Mon Sep 17 00:00:00 2001
From: QuinnDK <39618652+QuinnDK@users.noreply.github.com>
Date: Wed, 19 May 2021 10:07:40 +0800
Subject: [PATCH] =?UTF-8?q?Update=200516.=E6=9C=80=E9=95=BF=E5=9B=9E?=
 =?UTF-8?q?=E6=96=87=E5=AD=90=E5=BA=8F=E5=88=97.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0516.最长回文子序列.md | 27 ++++++++++++++++++++++++++
 1 file changed, 27 insertions(+)

diff --git a/problems/0516.最长回文子序列.md b/problems/0516.最长回文子序列.md
index d7acef99..7736b69f 100644
--- a/problems/0516.最长回文子序列.md
+++ b/problems/0516.最长回文子序列.md
@@ -173,6 +173,33 @@ Python：
 
 
 Go：
+```Go
+func longestPalindromeSubseq(s string) int {
+	lenth:=len(s)
+	dp:=make([][]int,lenth)
+	for i:=0;i<lenth;i++{
+		for j:=0;j<lenth;j++{
+			if dp[i]==nil{
+				dp[i]=make([]int,lenth)
+			}
+			if i==j{
+				dp[i][j]=1
+			}
+		}
+	}
+	for i:=lenth-1;i>=0;i--{
+		for j:=i+1;j<lenth;j++{
+			if s[i]==s[j]{
+				dp[i][j]=dp[i+1][j-1]+2
+			}else {
+				dp[i][j]=max(dp[i+1][j],dp[i][j-1])
+			}
+		}
+	}
+
+	return dp[0][lenth-1]
+}
+```