实验内容:
1.实验编程-基础-回文数
【问题描述】
键盘输入一个1-99999之间的数,程序拍段这个数字是几位数,并且判断该数是否是回文数。回文数值得是该数逆序排列后得到的数和原数相同。例如12212,3223 都是回文数。
【输入形式】
输入任意一个1-99999之间的数
【样例输入】
12421
【样例输出】
input 1-99999 number
12421 is 5 bit
12421 is huiwen number
import java.util.Scanner;
public class Demo12 {
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
int num=sc.nextInt();
int d5,d4,d3,d2,d1;
if(num>=1||num<=99999){
d5=num/10000;
d4=num%10000/1000;
d3=num%10000%1000/100;
d2=num%100/10;
d1=num%10;
System.out.println("input 1-99999 number");
if(d5>=1&&d5<=9){
System.out.println(num+" is 5 bit");
if(d1==d5&&d2==d4){
System.out.println(num+" is huiwen number");
}
}
else if(d5==0&&(d4>=1&&d5<=9)){
System.out.println(num+" is 4 bit");
if(d1==d4&&d2==d3){
System.out.println(num+" is huiwen number");
}
}
else if(d5==0&&d4==0&&d3!=0){
System.out.println(num+" is 3 bit");
if(d1==d3){
System.out.println(num+" is huiwen number");
}
}
else if(d2!=0){
System.out.println(num+" is 2 bit");
if(d1==d2){