9. 回文数

bool Algorithm::isPalindrome(int x)
{
	if (x < 0)
		return false;
	else if (x == 0)
	{
		return true;
	}

	int resX = 0;
	int iLast = 0;
	int iDev = 10;
	int iCount = 0;
	std::vector<int> vecPost;
	while (x != 0)
	{
		iLast = x % iDev;
		x = x / iDev;
		vecPost.push_back(iLast);
	}
	iCount = (int)vecPost.size();
	iCount = iCount / 2;
	std::vector<int>::iterator itorF = vecPost.begin();
	std::vector<int>::reverse_iterator itorB = vecPost.rbegin();
	for (int i = 0; i < iCount; i++)
	{
		if (*itorB != *itorF)
			return false;
		itorF++;
		itorB++;
	}

	return true;
}