9. Palindrome Number

LeetCode

class Solution {
    private long reverse(int x){
        long i=0;
        while(x!=0){
            i=i*10+x%10;
            x/=10;
        }
        return i;
    }
    public boolean isPalindrome(int x) {
        if(x<0) return false;
        return reverse(x)>Integer.MAX_VALUE?false:x==(int)reverse(x);
    }
}