回文字符串的最大长度



<pre name="code" class="cpp">#include<iostream>
#include<vector>
#include<string>
using namespace std;


//回文字符串判断
char*changeString(char*ptr,char*ptrch)
{
	int len = strlen(ptr);
	ptrch[0] = '#';
	for (int i = 0; i < len; i++)
	{
		ptrch[2 * i + 1] = ptr[i];
		ptrch[2 * i + 2] = '#';
	}
	return ptrch;
}

int numOfSpecialString(char*ptrch)
{
	int maxlen = 0;
	int len = strlen(ptrch);
	for (int i = 2; i < len-1; i ++)
	{
		int cont = 0;
		int proIndex ;
		int behIndex ;

		if (ptrch[i] == '#')
		{
			proIndex = i - 1;
			behIndex = i + 1;
		}
		else
		{
			proIndex = i - 2;
			behIndex = i + 2;
		}
			
		while ((proIndex != 1 || proIndex != 0) && (behIndex != len - 2 || behIndex != len - 1))
			{
				if (ptrch[proIndex] == ptrch[behIndex])
				{
					proIndex -= 2;
					behIndex += 2;
					cont+=2;
				}
				else 
					break;
			}
		if (ptrch[i] != '#')
			cont++;
		if (maxlen < cont)
			maxlen = cont;

	
		}
	return maxlen;
}


void main()
{
	int num;
	vector<int> vs;
	cin >> num;
	int count = num;
	while (count != 0)
	{
		char a[100];
		cin >> a;
		char b[10000] = "";
		char*ptrch = changeString(a, b);
		vs.push_back(numOfSpecialString(ptrch));
		//cout << numOfSpecialString(ptrch); 
		count--;
	}
	for (int i = 0; i < num; i++)

	{
		cout << vs[i]<<endl;
	}
	system("pause");
}



评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值