leetcode - Palindrome Number

 

class Solution {
public:
    int tenPow(int a){
        int rlt = 1;
        while (a-- > 0){
            rlt *= 10;
        }
        return rlt;
    }
    bool isPalindrome(int x) {
        // IMPORTANT: Please reset any member data you declared, as
        // the same Solution instance will be reused for each test case.
        if(x<0)
            return false;
        int i = 9;
        while (i>=0 && x / tenPow(i) <=0)
            i--;
        if (i<=0)
            return true;
        for (; i>=1; i-=2){
            if (x/tenPow(i) != x%10)
                return false;
            x %= tenPow(i);
            x /=10;
        }
        return true;
    }
};