Class Solution
java.lang.Object
g0501_0600.s0516_longest_palindromic_subsequence.Solution
516 - Longest Palindromic Subsequence.<p>Medium</p>
<p>Given a string <code>s</code>, find <em>the longest palindromic <strong>subsequence</strong>’s length in</em> <code>s</code>.</p>
<p>A <strong>subsequence</strong> is a sequence that can be derived from another sequence by deleting some or no elements without changing the order of the remaining elements.</p>
<p><strong>Example 1:</strong></p>
<p><strong>Input:</strong> s = “bbbab”</p>
<p><strong>Output:</strong> 4</p>
<p><strong>Explanation:</strong> One possible longest palindromic subsequence is “bbbb”.</p>
<p><strong>Example 2:</strong></p>
<p><strong>Input:</strong> s = “cbbd”</p>
<p><strong>Output:</strong> 2</p>
<p><strong>Explanation:</strong> One possible longest palindromic subsequence is “bb”.</p>
<p><strong>Constraints:</strong></p>
<ul>
<li><code>1 <= s.length <= 1000</code></li>
<li><code>s</code> consists only of lowercase English letters.</li>
</ul>
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
Solution
public Solution()
-
-
Method Details
-
longestPalindromeSubseq
-