1.利用StringBuffer将数字转换成字符串和逆序的字符串判断,使用字符串比较函数CompareTo
import java.util.Scanner;
public class huiwenshu3 {
public static void main(String args[]){
Scanner in=new Scanner(System.in);
String num=in.nextLine();
StringBuffer str1=new StringBuffer(""+num);
StringBuffer str0=new StringBuffer(""+num);
StringBuffer str2=new StringBuffer(str0.reverse());
String str3=str1+"";
String str4=str2+"";
if(str3.compareTo(str4)==0){
System.out.println("true");
}else{
System.out.println("false");
}
}
}
2.先将数字转换成字符串,然后写一个字符串逆序函数,再使用字符串比较函数CompareTo
import java.util.Scanner;
public class Huiwenshu2 {
public static void main(String args[]){
Scanner in=new Scanner(System.in);
int num=in.nextInt();
String str1=num+"";
String str2=f_reverse(str1);
if(str1.compareTo(str2)==0){
System.out.println("true");
}else{
System.out.println("false");
}
}
public static String f_reverse(String str){
char ch[]=str.toCharArray();
String res="";
for(int i=ch.length-1;i>=0;i--){
res+=ch[i];
}
return res;
}
}
3. 设置两个指针分别指向首尾,同时向中间移动指针,判断是否相等。
import java.util.Scanner;
public class Huiwenshu {
public static void main(String args[]){
Scanner in=new Scanner(System.in);
int num=in.nextInt();
String str=""+num;
char str1[]=str.toCharArray();
char str2[]=new char[str1.length];
for(int i=0;i<str1.length;i++){
str2[str1.length-1-i]=str1[i];
}
for(int i=0;i<str1.length;i++){
if(str1[i]!=str2[i]){
System.out.println("No");
return;
}
}
System.out.println("Yes");
return ;
}
}