List模板类实现回文判断

#include<iostream>
#include<list>
#include<string>
using namespace std;
template<typename Type>
bool IsPalinedrom(const list<Type>&List)
{
	list<Type>Li;
	Li=List;
	while(Li.size()>1)
	{
		if(Li.front()!=Li.back())
			return 0;
		Li.pop_front();
		Li.pop_back();
	}
	return 1;
}
int main()
{
	list<char> a;
	string b;
	while(getline(cin,b))
	{
		a.clear();
		for(int i=0;i<b.length();i++)
			a.push_back(b[i]);
		if(a.empty())
			cout<<"a is empty!"<<endl;
		else
		{
			if(IsPalinedrom(a))
				cout<<"a is palinedrom!"<<endl;
			else 
				cout<<"a is not palinedrom!"<<endl;
		}
	}
	return 0;
}