LEETCODE 9

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