【C++代码】最长回文子串-BF解法

#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
using namespace std;


bool Palindromic(string s, int i, int j)
{
    while (i < j)
    {
        if (s[i] == s[j])
        {
            i++;
            j--;
        }
        else
        {
            return false;
        }
    }
    return true;
}


string longestPalindrome(string s) 
{
    // brute force
    int len = s.size();
    if (len <= 1)
    {
        return s;
    }
    else
    {
        vector<pair<int, string>> max_substring;
        for (int i = 0; i < len - 1; ++i)
        {
            for (int j = i; j < len; ++j)
            {
                if (Palindromic(s, i, j))
                    max_substring.push_back(make_pair(j - i + 1, s.substr(i, j - i + 1)));
            }
        }
        sort(max_substring.begin(), max_substring.end(), greater<pair<int, string>>());
        return max_substring.front().second;
    }
}

vector<pair<int, string>> FullSubstring(string s)
{
    vector<pair<int, string>> max_substring;
    int len = s.size();
    if (len <= 0)
    {
        return max_substring;
    }
    else if (len == 1)
    {
        max_substring.push_back(make_pair(1, s));
        return max_substring;
    }
    else
    {
        
        for (int i = 0; i < len - 1; ++i)
        {
            for (int j = i; j < len; ++j)
            {
                if (Palindromic(s, i, j))
                    max_substring.push_back(make_pair(j - i + 1, s.substr(i, j - i + 1)));
            }
        }
        sort(max_substring.begin(), max_substring.end());
        return max_substring;
    }
}

int main()
{
    string str("abbacda");
    cout << "The full string : " << str << endl;
    vector<pair<int, string>> substring = FullSubstring(str); 
    for (int i = 0; i < substring.size(); ++i)
    {
        cout << "length : " << substring[i].first << " , substring : " << substring[i].second << endl;
    }
    cout << endl;
    //cout << "The longest sub_string : " << longestPalindrome(str) << endl;
    return 0;
}