【leetcode】Palindrome Number

Question：

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.

Anwser 1：         

[cpp]  view plain copy print ?

1. class Solution {  
2. public:  
3.     bool isPalindrome(int x) {  
4.         // Start typing your C/C++ solution below  
5.         // DO NOT write int main() function  
6.         if(x < 0) return false;  
7.           
8.         int div = 1;  
9.         while(x/10 >= div){     // get large division  
10.             div *= 10;  
11.         }  
12.           
13.         while(x > 9){  
14.             int high = x / div;     // left digit  
15.             int low = x % 10;       // right digit  
16.               
17.             if(high != low){  
18.                 return false;  
19.             }  
20.               
21.             x = (x % div) / 10;     // get number between first and last  
22.             div /= 100;  
23.         }  
24.           
25.         return true;  
26.     }  
27. };  

Anwser 2：      

[cpp]  view plain copy print ?

1. class Solution {  
2. public:  
3.     bool check(int x, int &y) {  
4.         if (x == 0) return true;  
5.       
6.         if (check(x/10, y) && (x%10 == y%10)) {  
7.             y /= 10;  
8.             return true;  
9.         } else {  
10.             return false;  
11.         }  
12.     }  
13.   
14.     bool isPalindrome(int x) {  
15.         // Start typing your C/C++ solution below  
16.         // DO NOT write int main() function  
17.         if(x < 0) return false;  
18.           
19.         return check(x, x);  
20.     }  
21. };  

参考推荐：

Palindrome Number

link: http://blog.csdn.net/ithomer/article/details/8798274