PAT-A1040 Longest Symmetric String 题目内容及题解

Given a string, you are supposed to output the length of the longest symmetric sub-string. For example, given Is PAT&TAP symmetric?, the longest symmetric sub-string is s PAT&TAP s, hence you must output 11.

Input Specification:

Each input file contains one test case which gives a non-empty string of length no more than 1000.

Output Specification:

For each test case, simply print the maximum length in a line.

Sample Input:

Is PAT&TAP symmetric?

Sample Output:

11

题目大意

题目给定一个非空字符串，从中找出最长的回文子串，并输出其长度。

解题思路

1. 建立函数检查某子串是否为回文子串；
2. 题目要求找出最长的回文子串，因此从最长的串开始枚举尝试，直到找到回文子串时退出；
3. 输出子串长度并返回0值。

代码

#include<stdio.h>
#include<string.h>
#define maxn 1010
char ch[maxn];
void init(){
    int i;