From 0a395dbed448dbc815806b12e48de74c131ee1e2 Mon Sep 17 00:00:00 2001
From: QuinnDK <39618652+QuinnDK@users.noreply.github.com>
Date: Mon, 17 May 2021 10:49:35 +0800
Subject: [PATCH] =?UTF-8?q?Update=201143.=E6=9C=80=E9=95=BF=E5=85=AC?=
=?UTF-8?q?=E5=85=B1=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/1143.最长公共子序列.md | 30 +++++++++++++++++++++++++-
1 file changed, 29 insertions(+), 1 deletion(-)
diff --git a/problems/1143.最长公共子序列.md b/problems/1143.最长公共子序列.md
index 19f4cc72..961924c8 100644
--- a/problems/1143.最长公共子序列.md
+++ b/problems/1143.最长公共子序列.md
@@ -166,6 +166,34 @@ class Solution:
Go：
+```Go
+func longestCommonSubsequence(text1 string, text2 string) int {
+ t1 := len(text1)
+ t2 := len(text2)
+ dp:=make([][]int,t1+1)
+ for i:=range dp{
+ dp[i]=make([]int,t2+1)
+ }
+
+ for i := 1; i <= t1; i++ {
+ for j := 1; j <=t2; j++ {
+ if text1[i-1]==text2[j-1]{
+ dp[i][j]=dp[i-1][j-1]+1
+ }else{
+ dp[i][j]=max(dp[i-1][j],dp[i][j-1])
+ }
+ }
+ }
+ return dp[t1][t2]
+}
+
+func max(a,b int)int {
+ if a>b{
+ return a
+ }
+ return b
+}
+```
@@ -174,4 +202,4 @@ Go：
* 作者微信：[程序员Carl](https://mp.weixin.qq.com/s/b66DFkOp8OOxdZC_xLZxfw)
* B站视频：[代码随想录](https://space.bilibili.com/525438321)
* 知识星球：[代码随想录](https://mp.weixin.qq.com/s/QVF6upVMSbgvZy8lHZS3CQ)
-
\ No newline at end of file
+
