Leetcode_009_Palindrome_Number

public class Solution {
    public boolean isPalindrome(int x) {
        if(x<0 || (x!=0 && x%10 == 0)) return false;
        int result = 0;
        while(x>result){
            result = result*10+x%10;
            x /= 10;
        }
        return (result == x) || (result/10 == x);
    }
}

 Only reverse half of the integer to avoid overflow cases :)