[leetcode]_Palindrome Number

public boolean isPalindrome(int x) {
        if(x < 0) return false;
        else if(x >= 0 && x <= 9) return true;
        else{
            int[] num = new int[20];
            int i = 0 ;
            while(x > 0){
                num[i++] = x % 10;
                x = x / 10;
            }
            
            int mMax = i / 2,kMin;
            if(i % 2 == 1)  kMin = i / 2;
            else  kMin = i / 2 - 1;
        
            for(int m = 0 , k = (i-1) ; m < mMax && k > kMin ; m++ , k--){
                   if(num[m] != num[k]) return false;
            }
            return true;
        }
}