[leetcode]Palindrome Number 回文数

 

  if (x<0){
		return false;
		
	}
	stringstream in;
	in << x;
	string s1 = in.str();
	int low = 0,high= s1.length()-1;
	while (low <= high)
	{
		if (s1[low] != s1[high])
		{
			return false;
		}
		low++;
		high--;
	}
	return true;