百度笔试：最长回文（中心扩展法）

#include <iostream>
using namespace std;

void huiwen(char* a, int& max, int& max_id)
{
	if(a==NULL || *a=='\0')
	{
		max = 0;
		max_id = 0;
		return ;
	}
	int len = strlen(a);
	int i, k1, k2;
	max = 1;
	max_id = 0;
	for(i=1; i<len-1; i++)
	{
		k1 = 1;
		while(i-k1>=0 && i+k1<len)
			if(a[i-k1] == a[i+k1])
				k1++;
			else
				break;
		k1 = 1 + (k1-1)*2;
		k2 = 0;
		if(a[i] == a[i+1])
		{
			k2 = 1;
			while(i-k2>=0 && i+1+k2<len)
				if(a[i-k2] == a[i+1+k2])
					k2++;
				else
					break;
			k2 = 2 + (k2-1)*2;
		}
		int k3 = k1>=k2?k1:k2;
		if(k3>max)
		{
			max = k3;
			max_id = i;
		}
	}

}

int main()
{
	int max, max_id;
	char s[100];
	while(1)
	{
		cin>>s;
		huiwen(s, max, max_id);
		int i = max_id - max/2 + 1 - (max&1);
		for(int j=0; j<max; j++, i++)
			cout<<s[i];
		cout<<endl;
	}
	return 0;
}