Question

用栈的形式判断一个字符是否为回文，（JAVA编程求助）怎么写的，谁会？？

使用栈的形式判断一个字符是否为回文。。。

Answer 1

import java.io.*;

public class HuiWen {
String reverse(String w1) {
String w2;
char []str1 = w1.toCharArray();
int len = w1.length();
char []str2 = new char[len];
for(int i = 0; i<len; i++) {
str2[i] = str1[len - 1 -i];
}
w2 = new String(str2);
return w2;
}

public static void main(String args[]) {
HuiWen hw1 = new HuiWen();
String pm ="";
try {
InputStreamReader Reader = new InputStreamReader(System.in);
BufferedReader input = new BufferedReader(Reader);
System.out.print("give your test String :\n");
pm = input.readLine();
}catch(IOException e) {
System.out.println("exception occur..");
}
String w2 = hw1.reverse(pm);
if(w2.compareTo(pm) == 0) {
System.out.println("It is a HuiWen");
}
else {
System.out.println("It is not a HuiWen");
}
}
}