【LeetCode Easy】009 Palindrome Number

Easy 009 Palindrome Number

Description:

Determine whether an integer is a palindrome. An integer is a palindrome when it reads the same backward as forward.
Example
123: true
-123: false
10: false

My Solution:

1. 比较简单的一道题目，用取模取余的方法求翻转后的整数和原来的整数进行比较就行（不用完全翻转，翻转一半就可）（这已经是最快的方法了）

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