PAT---Longest Symmetric String(求子串)

#include <iostream>
#include <string>

using namespace std;

bool isSym(string str)
{
    for(int i = 0; i < str.size()/2; i++)
        if(str[i] != str[str.size()-1-i])
            return false;
    return true;
}

int main()
{
    string str;
    while(getline(cin, str))
    {
        int max = 0;
        //两个for循环产生所有的子串
        for(int i = 0; i < str.size(); i++)
            for(int j = 1; j <= str.size()-i; j++)
            {
                string tmp =str.substr(i, j)
                if(isSym(tmp) && tmp.size() > max)
                    max = tmp.size();
            }
        cout << max << endl;
    }

    return 0;
}

猜你喜欢

转载自blog.csdn.net/mch2869253130/article/details/88181777