PAT_A_1040. Longest Symmetric String (25)

暴力求解法、

#include <iostream>
#include <cstdio>
#include <string>
using namespace std;

int f(string str) {
     for (int i = 0,j = str.size()-1; i <= j; i++,j--)
          if (str[i] != str[j]) return 0;
     return 1;
}

int main() {
    char ch[1000];
    string str;
    gets(ch);
    str = ch;
    int n = str.size(),max_len = 1;
    for (int i = 0; i < n; i++) {
          for (int j = 1; j <= n-i; j++) {
               string s = str.substr(i,j);
               //cout << s << endl;
               if (f(s) && s.size() > max_len)
                    max_len = s.size();
          }
    }
    cout << max_len << endl;
    return 0;
}