找到字符串中的最长回文子串_从字符串中找出最长的回文子序列

找到字符串中的最长回文子串

Problem statement:

问题陈述：

Given a string you have to find out the longest palindromic subsequence from the given string.

给定一个字符串，您必须从给定的字符串中找出最长的回文子序列。

    Input:
    T Test case
    T no of input string will be given to you.

    E.g.
    3
    
    bghaufahgt
    souabbuos
    sahajkhahas
    
    Constrain 
    1≤ length (string) ≤100
    
    Output:
    Print the longest palindromic subsequence from that string

Example

例

    T=3

    Input:
    bghaufahgt
    
    Output:
    ghafahg
    
    Input:
    souabbuos
    
    Output:
    soubbuos
    
    Input:
    sahajkhahas
    
    Output:
    sahajahas

Explanation with example:

举例说明：

Let there is a string str.

让我们有一个字符串str 。

Now possible arrangements are:

现在可能的安排是：

1. Single middle characters like aba

   像aba这样的单个中间字符

2. Paired middle characters like bb

   配对的中间字符，如bb

Let, f(a,b) = length of palindromic substring from index a to index b.

令f(a，b)=从索引a到索引b的回文子串的长度 。

Considering the above three facts:

考虑以上三个事实：

1. If there is only one character then f(a,a) = 1

   如果只有一个字符，则f(a，a)= 1

2. If there are two characters a and a+1 both are same then f(a,a+1) = 2 if both are not same then f(a,a+1) = 1.

   如果两个字符a和a + 1都相同，则f(a，a + 1)= 2；如果两个字符不相同，则f(a，a + 1)= 1 。

3. If there is a substring starting from index a to index b then,

   如果存在从索引a到索引b的子字符串，

   1. If str[a] and str[b] both are same then f(a,b) = f(a+1,b-1) + 2
   2. 如果str [a]和str [b]都相同，则f(a，b)= f(a + 1，b-1)+ 2
   3. If str[a] and str[b] both are not same then f(a,b)= max{ f(a+1,b) , f(a,b-1) }
   4. 如果str [a]和str [b]都不相同，则f(a，b)= max {f(a + 1，b)，f(a，b-1)}

For, str = bghaufahgt

因为， str = bghaufahgt

To find out the characters in the palindrome we will follow this approach:

为了找出回文中的字符，我们将采用以下方法：

1. The max length will be the top right block.

   最大长度将在右上角。

2. Every time we will check the left and bottom adjacent blocks.

   每次我们将检查左侧和底部相邻的块。

   1. If both the blocks contain the same value then we will go for any of them.
   2. If any block contains a value such that the difference between the current value and the value at the block is 2 then we will go for that block and make a note of that character present in the string whose index is the same as the column number.
   3. When we will get the value equals to 1 then stop the traversal.

C++ Implementation:

C ++实现：

#include <bits/stdc++.h>
using namespace std;

int arr[101][101];

void print_palindrome(string str)
{
    int len = str.length();
    int i = 0;
    int j = len - 1;
    int num = arr[i][j];
    vector<char> v;
    int flag = 0;
    while (i < len && j >= 0) {
        if (num == 2) {
            flag = 1;
            break;
        }
        if (num == 1)
            break;
        //if the left block has the value by which
        //the difference will be 2
        if (arr[i][j - 1] + 2 == num) {
            v.push_back(str[j]);
            j--;
            num = arr[i][j];
            if (num == 1 || num == 2) {
                v.push_back(str[j]);
            }
        }
        //if the bottam block has the value by
        //which the difference will be 2
        if (arr[i + 1][j] + 2 == num) {
            v.push_back(str[i]);
            i++;
            num = arr[i][j];
            if (num == 1 || num == 2) {
                v.push_back(str[i]);
            }
        }
        if (arr[i][j - 1] == num) {
            j--;
        }
        else {
            i++;
        }
    }
    for (int i = 0; i < v.size(); i++) {
        cout << v[i];
    }
    //cout<<endl;
    for (int i = v.size() - 1; i >= 0; i--) {
        if (flag && i == v.size() - 1) {
            cout << v[i];
        }
        else if (i != v.size() - 1) {
            cout << v[i];
        }
    }
    cout << endl;
}

void length_of_palindrom(string str)
{
    int len = str.length();
    memset(arr, 0, sizeof(arr));
    for (int i = 0; i < len; i++) {
        arr[i][i] = 1;
    }
    for (int i = 0; i < len - 1; i++) {
        if (str[i] == str[i + 1])
            arr[i][i + 1] = 2;
        else
            arr[i][i + 1] = 1;
    }
    for (int l = 3; l <= len; l++) {
        for (int i = 0; i <= len - l; i++) {
            int j = i + l - 1;
            if (str[i] == str[j])
                arr[i][j] = arr[i + 1][j - 1] + 2;
            else
                arr[i][j] = max(arr[i + 1][j], arr[i][j - 1]);
        }
    }
    cout << "Palindrome : ";
    print_palindrome(str);
    cout << endl;
    return;
}

int main()
{
    int t;
    cout << "Test Case : ";
    cin >> t;
    while (t--) {
        cout << "Enter the string : ";
        string str;
        cin >> str;
        length_of_palindrom(str);
    }
}

Output

输出量

Test Case : 3
Enter the string : bghaufahgt
Palindrome : ghafahg

Enter the string : souabbuos
Palindrome : soubbuos

Enter the string : sahajkhahas
Palindrome :  sahajahas

翻译自: https://www.includehelp.com/icp/find-out-the-longest-palindromic-subsequence-from-a-string.aspx

找到字符串中的最长回文子串