【hihocoder】#1366 : 逆序单词

题目链接：http://hihocoder.com/problemset/problem/1366

思路：

easy ，不解释

算法：

import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;
/**
 * http://hihocoder.com/problemset/problem/1366
 */
public class Main {

	public static void main(String[] args) {
		Main m = new Main();
		m.handleInput();
	}
	
	public void handleInput() {
		Scanner in = new Scanner(System.in);
		int n = 0;
		if (in.hasNext())
			n = in.nextInt();
		while (n > 0 && in.hasNext()) {
			n--;
			String s = in.next().trim();
			addAndCount(s); 
		}
		System.out.println(count);
	}
	
	Set<String> dict = new HashSet<>();
	int count = 0;
	public void addAndCount(String word){
		if(dict.contains(new StringBuilder(word).reverse().toString()))
				count++;
		dict.add(word);
	}

}