LeetCode-516. Longest Palindromic Subsequence

516. Longest Palindromic Subsequence

Medium

913132FavoriteShare

Given a string s, find the longest palindromic subsequence's length in s. You may assume that the maximum length of s is 1000.

Example 1:
Input:

"bbbab"

Output:

4

One possible longest palindromic subsequence is "bbbb".

 

Example 2:
Input:

"cbbd"

Output:

2

One possible longest palindromic subsequence is "bb".

 

Accepted

63,185

Submissions

134,047

 

 

int max(int a,int b){
    if(a>=b)
        return a;
    else
        return b;
}

int longestPalindromeSubseq(char * s){
  
    int dp[1001][1001] = {0};
    
    int length = strlen(s);
    for(int i=length-1;i>=0;i--){
        dp[i][i] = 1;
        for(int j=i+1;j<length;j++){
            if(s[i]==s[j]){
                dp[i][j] = dp[i+1][j-1]+2;
            }else{
                dp[i][j] = max(dp[i+1][j],dp[i][j-1]);
            }
        }
    }

    return dp[0][length-1];

}