华为机试题：回文字符判断

#include <iostream>
#include <stack>
#include <string>
using namespace std;

int ishuiwen(char*p)
{
	int len=strlen(p);
	int flag=1;
	for(int i=0;i<len/2;++i)
	{
		if(p[i]!=p[len-i-1])
		{
			flag=0;
			break;
		}
	}
	return flag;
}


int main()
{
	char* p=new char[1024];
	gets(p);
	int res=ishuiwen(p);
	cout<<res;
	return 0;
}