longest-common-subsequence

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given two strings <code>text1</code> and <code>text2</code>, return the length of their longest common subsequence. If there is no common subsequence, return <code>0</code>.

A subsequence of a string is a new string generated from the original string with some characters (can be none) deleted without changing the relative order of the remaining characters.

<ul>
	<li>For example, <code>&quot;ace&quot;</code> is a subsequence of <code>&quot;abcde&quot;</code>.</li>
</ul>

A common subsequence of two strings is a subsequence that is common to both strings.

&nbsp;
Example 1:

<pre>
Input: text1 = &quot;abcde&quot;, text2 = &quot;ace&quot; 
Output: 3 
Explanation: The longest common subsequence is &quot;ace&quot; and its length is 3.
</pre>

Example 2:

<pre>
Input: text1 = &quot;abc&quot;, text2 = &quot;abc&quot;
Output: 3
Explanation: The longest common subsequence is &quot;abc&quot; and its length is 3.
</pre>

Example 3:

<pre>
Input: text1 = &quot;abc&quot;, text2 = &quot;def&quot;
Output: 0
Explanation: There is no such common subsequence, so the result is 0.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= text1.length, text2.length &lt;= 1000</code></li>
	<li><code>text1</code> and <code>text2</code> consist of only lowercase English characters.</li>
</ul>

longestCommonSubsequence

Longest Common Subsequence

Longest Palindromic Subsequence

longest-palindromic-subsequence

最长回文子序列

Delete Operation for Two Strings

delete-operation-for-two-strings

两个字符串的删除操作

Shortest Common Supersequence 

shortest-common-supersequence

最短公共超序列

Maximize Number of Subsequences in a String

maximize-number-of-subsequences-in-a-string

字符串中最多数目的子序列

Subsequence With the Minimum Score

subsequence-with-the-minimum-score

最少得分子序列

String

Dynamic Programming

给定两个字符串 <code>text1</code> 和 <code>text2</code>，返回这两个字符串的最长 公共子序列 的长度。如果不存在 公共子序列 ，返回 <code>0</code> 。

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

<ul>
	<li>例如，<code>"ace"</code> 是 <code>"abcde"</code> 的子序列，但 <code>"aec"</code> 不是 <code>"abcde"</code> 的子序列。</li>
</ul>

两个字符串的 公共子序列 是这两个字符串所共同拥有的子序列。

 

示例 1：

<pre>
输入：text1 = "abcde", text2 = "ace" 
输出：3 
解释：最长公共子序列是 "ace" ，它的长度为 3 。
</pre>

示例 2：

<pre>
输入：text1 = "abc", text2 = "abc"
输出：3
解释：最长公共子序列是 "abc" ，它的长度为 3 。
</pre>

示例 3：

<pre>
输入：text1 = "abc", text2 = "def"
输出：0
解释：两个字符串没有公共子序列，返回 0 。
</pre>

 

提示：

<ul>
	<li><code>1 <= text1.length, text2.length <= 1000</code></li>
	<li><code>text1</code> 和 <code>text2</code> 仅由小写英文字符组成。</li>
</ul>