[LeetCode 9] Palindrome Number -- 回文数字

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

First of all, what is a palindrome number. A palindromic number is the number that remains the same, whenits digits reversed.

So, what is the idea?  

1. Just check whether the reversed number is the same with the original number is OK.

2. Check the first digits with the last digits, if the same, keep on checking, else return false. There is a trick to get the first digits.  [this solution is from Leetcode: http://leetcode.com/2012/01/palindrome-number.html]

3. Use the Recursive

class Solution {
public:
    bool isPalindrome(int x) {
        if(x < 0) return false;
        if(x == 0) return true; 
        
        int result = 0;
        int y = x;
        while(x != 0){
            result = result * 10 + x % 10;
            x = x/10;
        }
        
        if(y == result) 
            return true;
        else 
            return false;
    }
};

Solution 2.

class Solution {
public:
    bool isPalindrome(int x) {
      if (x < 0) return false;

      int div = 1; //good idea to get the first digit
      while (x / div >= 10) {
        div *= 10;
      }
        
      while (x != 0) {
        int l = x / div; //get the first digit
        int r = x % 10;
        if (l != r) return false;
        x = (x % div) / 10;  // get the middle digits, apart from the first and last digits.
        div /= 100;
      }
      return true;
    }
};

Solution 3: Recursive

class Solution {
public:
    bool isPalindrome(int x) {
      return isPalindrome(x, x);
    }
    
private: 
    bool isPalindrome(int x, int &y) {
      if (x < 0) return false;
      if (x == 0) return true;
      
      if (isPalindrome(x/10, y) && (x%10 == y%10)) {
            y /= 10;
        return true;
      } else {
        return false;
      }
    }
};