LeetCode9 Palindrome Number(判断一个数是不是回文数)

Determine whether an integer is a palindrome. 

package Leecode;public class isPalindrome {public static boolean isPalindrome(int x) {        int palindromeX = 0;        int inputX = x;        while(x>0){            palindromeX = palindromeX*10 + (x % 10);            x = x/10;            System.out.println("palindromeX是"+palindromeX);            System.out.println("x是"+x);        }        return palindromeX==inputX;    }public static void main(String[] args) {int i=1234554321;boolean test=isPalindrome(i);System.out.println(test);}}

输出：

palindromeX是1x是123455432palindromeX是12x是12345543palindromeX是123x是1234554palindromeX是1234x是123455palindromeX是12345x是12345palindromeX是123455x是1234palindromeX是1234554x是123palindromeX是12345543x是12palindromeX是123455432x是1palindromeX是1234554321x是0true