longest-palindromic-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 a string <code>s</code>, find the longest palindromic subsequence&#39;s length in <code>s</code>.

A subsequence is a sequence that can be derived from another sequence by deleting some or no elements without changing the order of the remaining elements.

&nbsp;
Example 1:

<pre>
Input: s = &quot;bbbab&quot;
Output: 4
Explanation: One possible longest palindromic subsequence is &quot;bbbb&quot;.
</pre>

Example 2:

<pre>
Input: s = &quot;cbbd&quot;
Output: 2
Explanation: One possible longest palindromic subsequence is &quot;bb&quot;.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= s.length &lt;= 1000</code></li>
	<li><code>s</code> consists only of lowercase English letters.</li>
</ul>

longestPalindromeSubseq

Longest Palindromic Subsequence

Longest Palindromic Substring

longest-palindromic-substring

最长回文子串

Palindromic Substrings

palindromic-substrings

回文子串

Count Different Palindromic Subsequences

count-different-palindromic-subsequences

统计不同回文子序列

Longest Common Subsequence

longest-common-subsequence

最长公共子序列

Longest Palindromic Subsequence II

longest-palindromic-subsequence-ii

最长回文子序列 II

Maximize Palindrome Length From Subsequences

maximize-palindrome-length-from-subsequences

由子序列构造的最长回文串的长度

Maximum Product of the Length of Two Palindromic Subsequences

maximum-product-of-the-length-of-two-palindromic-subsequences

两个回文子序列长度的最大乘积

String

Dynamic Programming

给你一个字符串 <code>s</code> ，找出其中最长的回文子序列，并返回该序列的长度。

子序列定义为：不改变剩余字符顺序的情况下，删除某些字符或者不删除任何字符形成的一个序列。

 

示例 1：

<pre>
输入：s = "bbbab"
输出：4
解释：一个可能的最长回文子序列为 "bbbb" 。
</pre>

示例 2：

<pre>
输入：s = "cbbd"
输出：2
解释：一个可能的最长回文子序列为 "bb" 。
</pre>

 

提示：

<ul>
	<li><code>1 <= s.length <= 1000</code></li>
	<li><code>s</code> 仅由小写英文字母组成</li>
</ul>