longest_palindromic_subsequence.cpp File Reference

Program to find the Longest Palindormic Subsequence of a string. More...

#include <cassert>
#include <string>
#include <vector>

Include dependency graph for longest_palindromic_subsequence.cpp:

Functions
std::string	lps (const std::string &a)
void	test ()
int	main ()

Detailed Description

Program to find the Longest Palindormic Subsequence of a string.

Palindrome string sequence of characters which reads the same backward as forward 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.

Author

Anjali Jha

Function Documentation

lps()

std::string lps

(

const std::string &

a

)

for assert for std::string for std::vector Function that returns the longest palindromic subsequence of a string

                                  {
    const auto b = std::string(a.rbegin(), a.rend());
    const auto m = a.length();
    using ind_type = std::string::size_type;
    std::vector<std::vector<ind_type> > res(m + 1,
                                            std::vector<ind_type>(m + 1));
 
    // Finding the length of the longest
    // palindromic subsequence and storing
    // in a 2D array in bottoms-up manner
    for (ind_type i = 0; i <= m; i++) {
        for (ind_type j = 0; j <= m; j++) {
            if (i == 0 || j == 0) {
                res[i][j] = 0;
            } else if (a[i - 1] == b[j - 1]) {
                res[i][j] = res[i - 1][j - 1] + 1;
            } else {
                res[i][j] = std::max(res[i - 1][j], res[i][j - 1]);
            }
        }
    }
    // Length of longest palindromic subsequence
    auto idx = res[m][m];
    // Creating string of index+1 length
    std::string ans(idx, '\0');
    ind_type i = m, j = m;
 
    // starting from right-most bottom-most corner
    // and storing them one by one in ans
    while (i > 0 && j > 0) {
        // if current characters in a and b are same
        // then it is a part of the ans
        if (a[i - 1] == b[j - 1]) {
            ans[idx - 1] = a[i - 1];
            i--;
            j--;
            idx--;
        }
        // If they are not same, find the larger of the
        // two and move in that direction
        else if (res[i - 1][j] > res[i][j - 1]) {
            i--;
        } else {
            j--;
        }
    }
 
    return ans;
}

Here is the call graph for this function:

main()

int main

(

void

)

Main Function

           {
    test();  // execute the tests
    return 0;
}

Here is the call graph for this function:

test()

void test

(

)

Test function

            {
    assert(lps("radar") == "radar");
    assert(lps("abbcbaa") == "abcba");
    assert(lps("bbbab") == "bbbb");
    assert(lps("") == "");
}

Here is the call graph for this function: