g0501_0600.s0516_longest_palindromic_subsequence

Class Solution

java.lang.Object

g0501_0600.s0516_longest_palindromic_subsequence.Solution

public class Solution
extends Object

516 - Longest Palindromic Subsequence.

Medium

Given a string s, find the longest palindromic subsequence’s length in s.

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.

Example 1:

Input: s = “bbbab”

Output: 4

Explanation: One possible longest palindromic subsequence is “bbbb”.

Example 2:

Input: s = “cbbd”

Output: 2

Explanation: One possible longest palindromic subsequence is “bb”.

Constraints:

• 1 <= s.length <= 1000
• s consists only of lowercase English letters.

Constructor Summary

Constructors

Constructor and Description
Solution()

Method Summary

Modifier and Type	Method and Description
int	longestPalindromeSubseq(String s)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

Solution

public Solution()

Method Detail

longestPalindromeSubseq

public int longestPalindromeSubseq(String s)