Palindrome Number

package leetcode.xuyi;

import org.junit.Test;

/**
 * Created by ethan on 2015/5/13.
 */
public class PalindromeNumber {
    public boolean isPalindrome(int x) {
        if(x<0)
            return  false;
        if (x == 0)
            return true;;
        int len = 1;
        while(x/len >= 10){
            len *= 10;
        }
        while(x!=0){
            int left = x%10;
            int right = x/len;
            if (left != right){
                System.out.println(left + " " + right);
                return  false;
            }

            x = (x % len) /10;
            len = len/100;
        }
        return  true;
    }
    @Test
    public void test9(){
        System.out.println(isPalindrome(1001));
    }
}