LeetCode 9. Palindrome Number

class Solution {
public:
    bool isPalindrome(int x) {
        if(x<0)
            return false;
        int fuck=log10(x);
        int num=0,mid=(fuck)>>1;
        for(int i=0;i<=mid;i++)
            num*=10,num+=x%10,x/=10;
        if(num==x||num/10==x)
            return true;
        return false;
    }
};

class Solution {
public:
    bool isPalindrome(int x) {
        if(x<0)
            return false;
        if(x<10)
            return true;
        int fuck=log10(x);
        int bit=1000000;
        int cnt=6;
        while(cnt!=fuck)
        {
            if(cnt>fuck)
                cnt--,bit/=10;
            else 
                cnt++,bit*=10;
        }
        for(int i=0;i<(fuck+1)>>1;i++)
        {
            if(x%10==x/bit%10)
                x/=10,bit/=100;
            else
                return false;
        }
        return true;

    }
};