PAT甲 1040 Longest Symmetric String (25 分)

最新推荐文章于 2024-07-13 03:01:23 发布

不想做程序猿的梦想家

最新推荐文章于 2024-07-13 03:01:23 发布

阅读量78

点赞数

分类专栏： PAT甲

本文链接：https://blog.csdn.net/weixin_43242657/article/details/119704969

版权

字符串处理对称子串暴力求解算法 C++

关键词由CSDN通过智能技术生成

PAT甲专栏收录该内容

39 篇文章 0 订阅

订阅专栏

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

考虑两种情况，aba和aa，因为字符串长度短，暴力求解就可以，比较简单。

#include<iostream>
#include<cstring>
using namespace std;

int main() {
	char str[1001];
	int max=1;
	cin.getline(str, 1001);
	for (int i = 1; i < strlen(str); i++) {
		for (int j = 1; j < strlen(str); j++) {
			if (i - j < 0 || i + j > strlen(str)) break;
			if (str[i - j] == str[i + j]) {
				if (j * 2 + 1 > max) max = j * 2 + 1;
			}
			else break;
		}
	}

	for (int i = 1; i < strlen(str); i++) {
		for (int j = 0; j < strlen(str); j++) {
			if (i-j-1 < 0 || i + j > strlen(str)) break;
			if (str[i - j-1] == str[i + j]) {
				if (j * 2 +2 > max) max = j * 2 + 2;
			}
			else break;
		}
	}

	cout << max;
	return 0;
}