09.回文数

class Solution {
    public boolean isPalindrome(int x) {
        if(x<0){
            return false;
        }
        boolean res = false;
        int[] ins = new int[20];
        int index =0;
        while(x!=0){
            ins[index++] = x%10;
            x = x/10;
        }
        int i=0,j=index-1;
        for(;i<j&&ins[i]==ins[j];i++,j--);
        if(i>=j){
            res= true;
        }
        return res;
    }
} 

class Solution {
    public boolean isPalindrome(int x) {
        if(x<0){
            return false;
        } 
        int y=0,ty = 0;
        int tx =x;
        while(tx!=0){
            ty = tx%10;
            y=y*10+ty;
            tx = tx/10;
        }
        return x==y;
    }
}