LeetCode--Palindrome Number

关键：如何取最高位的数？

class Solution {
public:
    bool isPalindrome(int x) {
        if(x < 0)   
            return false;
        int div = 1;
        int xorg = x;
        while(x >= 10)
        {
            div = div*10;
            x = x/10;
        }
        x = xorg;
        while(x > 0 && div>0)
        {
            int r = x%10;
            int l = x/div;
            if(l != r)
            {
                return false;
            }
            x = (x%div)/10;
            div = div/100;
        }
        return true;
    }
};