leetcode 9. Palindrome Number

回文数不错的思路

 public boolean isPalindrome(int x) {         if(x < 0){        return false;        }        int div = 1;        while( x / div >= 10){        div *= 10;        }        while(x != 0){        int tmp1 = x / div;        int tmp2 = x % 10;        if(tmp1 != tmp2){        return false;        }        x = (x % div) /10;        div /= 100;        } return true;    }