[Leetcode]Palindrome Number

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

class Solution {public:    /*algorithm     for number abcd , compare head and tail digit meantime     if it is same, remove head and tail digit unitl digit is one or empty     this can avoid overflow     another way is we can transform the x to string and check whehter the string is palindrome    */    bool isPalindrome(int x) {        if(x < 0)return false;        int div = 1;        while(x/10 >= div)            div *= 10;        while(x){            if((x/div) != (x%10))return false;            x = x%div/10;            div /= 100;        }        return true;    }};