回文数解答

这里给一个在leetcode上可以编译通过的答案

public class Solution {


    public static boolean isPalindrome(int x) {
        int originalNum1=x;
        int originalNum=x;
        int lastNum=0;
        int palindrome=0;
        while (originalNum!=0){
            lastNum = originalNum % 10 ;
            palindrome = palindrome * 10 + lastNum;
            originalNum/=10;
        }


        return originalNum1==palindrome;
    }

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int i = Integer.parseInt(scanner.nextLine());

        if (isPalindrome(i)==true & i>0){
            System.out.println("回文数:"+i);
        }
        else{
            System.out.println("不是回文数");
        }

    }
}

这句话是避免出现复数的情况 判断数字为回文并且非负才可以通过

if (isPalindrome(i)==true & i>0)