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");
		}
	}
}

[hdu 2029] Palindromes _easy version

Palindromes _easy version