public class huiwen {
public static int reverse(int i, String s){
//核心代码
if (i < 10) {
s=s+i;
return Integer.parseInt(s);
}else {
s=s+i%10;
return reverse(i/10,s);
}
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int a =sc.nextInt();
System.out.println(reverse(a,""));
//System.out.println(reverse(1345,""));
}
}
输入一个区间,得区间内的内的回文数。
for (int i = a; i <=b; i++) {
if (i ==reverse(i,"")) {
System.out.println(i+"");
}
}
输入一组正整数,判断输入的数字是否是回文数,是则输出该数。输入-1时结束。
if (n==reverse(n,"")) {
System.out.println(" 是回文数" + n + " ");
}else {
System.out.println(n+"不是回文数");
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println(" 请输入数字,输入-1结束");
int n =sc.nextInt();
while (n!=-1){
getPalindromeNumber(n);
System.out.println("请输入数字,输入-1结束");
n=sc.nextInt();
}
}