Palindromes _easy version

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


Problem Description “回文串”是一個正讀和反讀都一樣的字符串，比如“level”或者“noon”等等就是回文串。請寫一個程序判斷讀入的字符串是否是“回文”。
Input 輸入包含多個測試實例，輸入數據的第一行是一個正整數n,表示測試實例的個數，後面緊跟著是n個字符串。

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

Sample Input

4
level
abcde
noon
haha

Sample Output

yes
no
yes
no

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		
		int n = scanner.nextInt();
		scanner.nextLine();

		while (n-- != 0) {
			String str = scanner.nextLine();
			int len = str.length();

			boolean flag = true;
			for (int i = 0; i < len / 2; i++) {
				if (!(str.charAt(i) == str.charAt(len - i - 1))) {
					flag = false;
					break;
				}
			}
			System.out.println(flag ? "yes" : "no");
		}
	}
}