From 64989ffe040c4ac06195a6a40655aac435e0d956 Mon Sep 17 00:00:00 2001
From: LiangDazhu <42199191+LiangDazhu@users.noreply.github.com>
Date: Fri, 9 Jul 2021 07:51:36 +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

补充1143题目链接
---
 problems/1143.最长公共子序列.md | 2 ++
 1 file changed, 2 insertions(+)

diff --git a/problems/1143.最长公共子序列.md b/problems/1143.最长公共子序列.md
index 2ddab584..8e245c20 100644
--- a/problems/1143.最长公共子序列.md
+++ b/problems/1143.最长公共子序列.md
@@ -8,6 +8,8 @@
 
 ## 1143.最长公共子序列 
 
+题目链接: https://leetcode-cn.com/problems/longest-common-subsequence/
+
 给定两个字符串 text1 和 text2，返回这两个字符串的最长公共子序列的长度。  
 
 一个字符串的 子序列 是指这样一个新的字符串：它是由原字符串在不改变字符的相对顺序的情况下删除某些字符（也可以不删除任何字符）后组成的新字符串。