Movatterモバイル変換


[0]ホーム

URL:


Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit34dba19

Browse files
Merge pull requestyoungyangyang04#481 from LiangDazhu/patch-30
Update 1143.最长公共子序列.md
2 parentse410ff3 +64989ff commit34dba19

File tree

1 file changed

+2
-0
lines changed

1 file changed

+2
-0
lines changed

‎problems/1143.最长公共子序列.md

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -8,6 +8,8 @@
88

99
##1143.最长公共子序列
1010

11+
题目链接:https://leetcode-cn.com/problems/longest-common-subsequence/
12+
1113
给定两个字符串 text1 和 text2,返回这两个字符串的最长公共子序列的长度。
1214

1315
一个字符串的 子序列 是指这样一个新的字符串:它是由原字符串在不改变字符的相对顺序的情况下删除某些字符(也可以不删除任何字符)后组成的新字符串。

0 commit comments

Comments
 (0)

[8]ページ先頭

©2009-2025 Movatter.jp