回文数的判断

#include "stdafx.h"
#include <iostream>
#include <deque>

using namespace std;

bool testsymmetry(int n)
{
	int temp;
	bool flag=false;
	deque<int> s;

	while(1)
	{
		temp=n%10;
		s.push_front(temp);
		n=n/10;
		if(n==0)
		{
			break;
		}
	}

	int size=s.size()/2;
	while(size!=0)
	{
		if(s.front()==s.back())
		{
			flag=true;
			s.pop_back();
			s.pop_front();
			size--;
		}
		else
		{
			flag=false;
			break;
		}
	}

	return flag;
}

int main(int arc, char** argv)
{
	int n;
	bool flag;
	while(1)
	{
		cout<<"Please enter a number!"<<endl;
		cin>>n;
		if(n==-1)
		{
			break;
		}
		flag=testsymmetry(n);

		if(flag==true)
		{
			cout<<n<<" is a symmetry."<<endl;
		}
		else
		{
			cout<<n<<" is not a symmetry."<<endl;
		}
	}

	system("pause");
	return 0;
}