[Leetcode] #9 Palindrome Number

Discription:

Determine whether an integer is a palindrome. Do this without extra space.

click to show spoilers.

Some hints:

Could negative integers be palindromes? (ie, -1)

If you are thinking of converting the integer to string, note the restriction of using extra space.

You could also try reversing an integer. However, if you have solved the problem "Reverse Integer", you know that the reversed integer might overflow. How would you handle such case?

There is a more generic way of solving this problem.

Solution:

//头尾比较看是否相等  注意溢出的处理
bool isPalindrome(int x) {
	if (x < 0)
		return false;
	int len = 1;
	while (x/len>=10){
		len *= 10;
	}
	int left, right;
	while (x>0){
		left = x / len;
		right = x % 10;
		if (left != right)
			return false;
		else{
			x = (x % len) / 10;
			len /= 100;
		}
	}
	return true;
}

//旋转一半的数字
bool isPalindrome(int x) {
    if(x<0|| (x!=0 &&x%10==0)) return false;
    int sum=0;
    while(x>sum)
    {
        sum = sum*10+x%10;
        x = x/10;
    }
    return (x==sum)||(x==sum/10);
}

GitHub-Leetcode:https://github.com/wenwu313/LeetCode