题解 | #最长回文子串#
最长回文子串
http://www.nowcoder.com/practice/12e081cd10ee4794a2bd70c7d68f5507
#include <cstdio>
#include <cstring>
using namespace std;
bool isHw(char *arr, int i, int j) {
while(i < j) {
if(arr[i] == arr[j]) {
i++;
j--;
} else{
return false;
}
}
return true;
}
int main() {
char arr[360];
while(EOF != scanf("%s", arr)) {
int len = strlen(arr);
int maxHwLen = 1;
for(int i=0; i<len; i++) {
for(int j=i+1; j<len; j++) {
if(isHw(arr, i, j)) {
int hwLen = j-i+1;
if(hwLen > maxHwLen){
maxHwLen = hwLen;
}
}
}
}
printf("%d\n", maxHwLen);
}
return 0;
}