PAT-Advanced-1040. 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:

Sample Output:

Update: 2016/3/23 增加了使用了

 

的版本

代码如下:

 

 

发表评论

电子邮件地址不会被公开。 必填项已用*标注