首先了解什么是回文字符串,就是正读反读均相同的字符序列,所以是中间对称的。像aha,ahaha,等等;
可以用不同的方法判断。
1.利用栈的特性(后进先出)实现
public static boolean isHuiWen(String str){
Stack<Character> stack = new Stack<>();
char []chars = str.toCharArray();
int length = chars.length - 1;
int mid = length /2;
//入栈 中间点之前的字符
for (int i = 0; i < mid; i ++){
stack.push(chars[i]);
}
System.out.println(stack.toString());
//出栈与mid之后的字符进行比较
for(int i = mid + 1; i <= length; i ++){
Character flag = stack.pop();
if(flag != chars[i]){
System.out.println("flag,"+flag);
System.out.println("i,"+i+",chars[i],"+chars[i]);
return false;
}
}
return true;
}
2.将数转换为字符数组,然后两端同步比较
public static boolean isPalindrome(String str) {
char [] chars = str.toCharArray();
int i = (chars.length - 1) / 2;
System.out.println(i);
for (int j = 0; j <= i; j ++){
if(chars[j] != chars[chars.length - 1 - j]){
System.out.println("chars[j]"+chars[j]);
System.out.println("chars.length - j"+chars[chars.length - 1 - j]);
return false;
}
}
return true;
}
3.如果是数字的话,利用数学运算取余,将数倒转,然后比较
public static boolean isPalindrome2(int x){
if(x < 0) return false;
int res = 0;
int flag = x;
while (x != 0){
res = res *10 + x % 10;
System.out.println(res);
x /= 10;
System.out.println(x);
}
return res == flag;
}