Problem Description
“回文串”是一个正读和反读都一样的字符串,比如“level”或者“noon”等等就是回文串。请写一个程序判断读入的字符串是否是“回文”。
Input
输入包含多个测试实例,输入数据的第一行是一个正整数n,表示测试实例的个数,后面紧跟着是n个字符串。
Output
如果一个字符串是回文串,则输出"yes",否则输出"no".
Sample Input
4 level abcde noon haha
Sample Output
yes no yes noimport java.util.Scanner; /** * @author 逸川同学 * */ public class P2029 { private static Scanner scanner; public static void main(String[] args) { scanner = new Scanner(System.in); while (scanner.hasNext()) { int n = scanner.nextInt(); int[]a = new int[n]; for (int i = 0; i < a.length; i++) { String string = scanner.next(); if(judge(string)){ a[i] = 1; } } for (int i = 0; i < a.length; i++) { if(a[i] ==1){ System.out.println("yes"); }else { System.out.println("no"); } } } } private static boolean judge(String string) { char ch[] = string.toCharArray(); for (int i = 0; i < (ch.length)/2; i++) { if(ch[i] != ch[ch.length-i-1] ){ return false; } } return true; } }