HDU 2029 Palindromes _easy version

Palindromes _easy version

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 16786 Accepted Submission(s): 10544

Problem Description“迴文串”是一個正讀和反讀都一樣的字串，比如“level”或者“noon”等等就是迴文串。請寫一個程式判斷讀入的字串是否是“迴文”。

Input輸入包含多個測試執行個體，輸入資料的第一行是一個正整數n,表示測試執行個體的個數，後面緊跟著是n個字串。

Output如果一個字串是迴文串，則輸出"yes",否則輸出"no".

Sample Input

4levelabcdenoonhaha

Sample Output

yesnoyesno

import java.io.*;import java.util.*;public class Main {public static void main(String[] args) {Scanner sc = new Scanner(new BufferedInputStream(System.in));int n = sc.nextInt();for (int i = 0; i < n; i++) {String s1 = sc.next();StringBuffer bu = new StringBuffer(s1);String s2 = bu.reverse().toString();//將字串翻轉if (s1.equals(s2))System.out.println("yes");elseSystem.out.println("no");}}}