package passage2;
import java.util.Scanner;
public class huiwen {
private static boolean huiwen1(String str) {
StringBuilder sb = new StringBuilder(str);
sb.reverse();
return sb.toString().equals(str);
}
private static boolean huiwen2(String str, int low, int high) {//high对应的是字符串的长度
if (high == 0 || high == 1) {
return true;
} else {
char c1 = str.charAt(low), c2 = str.charAt(high);
if (c1 == c2) { // 字符对比相等
return huiwen2(str, low + 1, high - 1);
} else { // 字符对比不相等
return false;
}
}
}
private static boolean huiwen3(String str) {
char[] a = str.toCharArray();//变为数组形式
int maxSize = a.length / 2;
for (int i = 0; i < maxSize; i++) {
if (a[i] != a[a.length - 1 - i]) {
//前后进行对比
return false;
}
}
return true;
}
public static void main(String[] args) {
Scanner scanner=new Scanner(System.in);
System.out.println("判断是否为回文");
System.out.println("请输入一串字符");
String a=scanner.next();
System.out.println(huiwen1(a));
System.out.println(huiwen2(a,0,a.length()-1));
System.out.println(huiwen3(a));
// TODO 自动生成的方法存根
}
}
版权声明:本文为weixin_62190821原创文章,遵循CC 4.0 BY-SA版权协议,转载请附上原文出处链接和本声明。