algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-07 15:45:40 +08:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #481 from LiangDazhu/patch-30

Browse Source 
Update 1143.最长公共子序列.md
This commit is contained in:
程序员Carl
2021-07-13 00:36:56 +08:00
committed by GitHub
parent e410ff3619 64989ffe04
commit 34dba19dd1
1 changed files with 2 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
problems/1143.最长公共子序列.md
View File

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