Leetcode003 -- judge whether an integer is a palindrome number

import java.util.Scanner;

/**
 *  Give you an integer  x , If  x  Is a palindrome integer , return  true ; otherwise , return  false .
 *  Palindrome number refers to positive order （ From left to right ） Reverse order （ From right to left ） Read all the same integers . for example ,121  It's palindrome. , and  123  No .
 *
 *  Example  1：
 *  Input ：x = 121
 *  Output ：true
 *
 *  Example 2：
 *  Input ：x = -121
 *  Output ：false
 *  explain ： Read left to right ,  by  -121 .  Read right to left ,  by  121- . So it's not a palindrome number .
 *
 *  Example  3：
 *  Input ：x = 10
 *  Output ：false
 *  explain ： Read right to left ,  by  01 . So it's not a palindrome number .
 *
 *  Example  4：
 *  Input ：x = -101
 *  Output ：false
 *
 *
 *  Tips ：
 * -231<= x <= 231- 1
 *
 */
public class test03 {
    public static void main(String[] args) {
        System.out.print(" Please enter a number ：");
        Scanner sc = new Scanner(System.in);
        int num = sc.nextInt();

        if(isPalindrome(num)){
            System.out.println(num+" It's palindrome number ！");
        }else{
            System.out.println(num+" Not palindrome ！");
        }
    }

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