leetcode9. Palindrome Number

easy程度题

题目：

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

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.

判断一个整数是否是回文数，负数不能是，若将一个整数反转有可能溢出（对int来说）

参考了leedcode上的解法，只对整数翻转一半然后进行比较

AC解：

class Solution {public:    bool isPalindrome(int x)    {        if( (x < 0) || (x > 0 && x % 10 == 0) )            return false;                int result = 0;        while(result < x)        {            result = result * 10 + x % 10;            x = x / 10;        };                return (result == x) || (x == result / 10);    }};