leetcode: Palindrome Number

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.

思路

简单想来，就是把每一位都算出来，然后比较。关于那个“without extra space"的意思，我理解为使用O(1)的空间吧（貌似也不能这么说，毕竟整数的位数也没有大到哪里去，撑死10位）。

class Solution {
public:
    bool isPalindrome(int x) {
        // IMPORTANT: Please reset any member data you declared, as
        // the same Solution instance will be reused for each test case.
		if (x<0) return false;
		int xb=x;
		int numDigits=0;
		int xd=1;
		while(xb!=0)
		{
			numDigits++;
			xb=xb/10;
			if(xb!=0) xd*=10;
		}
		xb=x;
		for(int i=0;i<numDigits/2;i++)
		{
			if (xb/xd!=xb%10)
				return false;
			xb=xb-(xd+1)*(xb%10);
			xd/=100;
			xb=xb/10;
		}
		if (xb<=9 && numDigits%2==1)
			return true;
		else if (xb==0 && numDigits%2==0)
			return true;
		else
			return false;
    }
};

旁边的同学看到了，想出来了一个更好的方法，就是如下 ，很简单看一眼就明白：

class Solution {
public:
    bool isPalindrome(int x) {
        // IMPORTANT: Please reset any member data you declared, as
        // the same Solution instance will be reused for each test case.
		if (x<0) return false;
		if (x<10) return true;
		int r=0,xb=x;
		while(r<xb)
		{
			r=r*10+xb%10;
			xb=xb/10;
		}
		if(r==xb || (r/10==xb && xb!=0)) return true;
		else return false;
    }
};

就是有一点，不知道为什么leetcode给的运行时间前面的是240ms，后者是248ms