leetcode9 回文数

Java代码

public class isPalindrome_9 {
    public boolean isPalindrome(int x) {
        String s = String.valueOf(x);
        System.out.println(s);
        StringBuffer sb = new StringBuffer(s).reverse();
        String s2 = sb.toString();
        System.out.println(s2);
        return s.equals(s2);
    }

    public static void main(String[] args) {
        isPalindrome_9 isPalindrome_9 = new isPalindrome_9();
        System.out.println(isPalindrome_9.isPalindrome(121));
    }
}

public class isPalindrome_9_2 {
    public boolean isPalindrome(int x) {
        if(x<0 || x%10==0 && x!=0){
            return false;
        }else if (x == 0){
            return true;
        }else{
            int reverseNum = 0;
            while(reverseNum < x){
                reverseNum = reverseNum*10 + x%10;
                x = x/10;
            }
            return x == reverseNum || x == reverseNum/10;
        }
    }
    public static void main(String[] args) {
        isPalindrome_9_2 isPalindrome_9 = new isPalindrome_9_2();
        System.out.println(isPalindrome_9.isPalindrome(10));
    }
}