3.19编程打卡

**6.3（回文整数）使用下面的方法头编写两个方法：

//Return the reversal of an integer,i,e.,reverse(456) returns 654
public static int reverse(int number)

//Return true if number is a palindrome
public static boolean isPalindrome(int number)

import java.util.*;

public class o {

    public static int reverse(int number) {
        int eve;
        int s = 0;
        int an = number;//eve是余数，an是除数
        while(an != 0) {
            eve = an % 10;
            s=s * 10 + eve;
            an /= 10;
        }
        return s;
    }
    public static boolean isPalindrome(int number) {
        boolean judge = true;
        int eve;
        int s = 0;
        int an = number;//eve是余数，an是除数
        while(an != 0) {
            eve = an % 10;
            s=s * 10 + eve;
            an /= 10;
        }
        if(s!=number) {
            judge = false;
        }
        return judge;
    }
    public static void main(String[] args) {
        int number;
        Scanner input = new Scanner(System.in);
        System.out.print("请输入一个整数");
        number = input.nextInt();
        if((reverse(number)==number)&&isPalindrome(number)) {
            System.out.println("这是一个回文整数");
        }
        else {
            System.out.println("这不是一个回文整数");
        }
    }
}