LeetCode 48 Anagrams

public class Solution {
	public List<String> anagrams(String[] strs) {
		ArrayList<String> result = new ArrayList<String>();
		HashMap<String, String> hm = new HashMap<String, String>();
		for (String str : strs) {
			char[] c = str.toCharArray();
			Arrays.sort(c);
			if (!hm.containsKey(String.valueOf(c))) {
				hm.put(String.valueOf(c), str);
			} else {
				String s = hm.get(String.valueOf(c));
				if (!result.contains(s))//某个回文序列第一次出现的单词，
										//我们并没有加入，如今补上
					result.add(s);
				result.add(str);
			}
		}
		return result;
	}
}