java.lang.Object
g0501_0600.s0516_longest_palindromic_subsequence.Solution

public class Solution extends Object
516 - Longest Palindromic Subsequence.<p>Medium</p> <p>Given a string <code>s</code>, find <em>the longest palindromic <strong>subsequence</strong>&rsquo;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 = &ldquo;bbbab&rdquo;</p> <p><strong>Output:</strong> 4</p> <p><strong>Explanation:</strong> One possible longest palindromic subsequence is &ldquo;bbbb&rdquo;.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> s = &ldquo;cbbd&rdquo;</p> <p><strong>Output:</strong> 2</p> <p><strong>Explanation:</strong> One possible longest palindromic subsequence is &ldquo;bb&rdquo;.</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 Details

    • Solution

      public Solution()
  • Method Details

    • longestPalindromeSubseq

      public int longestPalindromeSubseq(String s)