[leetcode]Anagrams @ Python

原题地址：https://oj.leetcode.com/problems/anagrams/

题意：

Given an array of strings, return all groups of strings that are anagrams.

Note: All inputs will be in lower-case.

解题思路：anagram的意思是：abc，bac，acb就是anagram。即同一段字符串的字母的不同排序。将这些都找出来。这里使用了哈希表，即Python中的dict。针对前面的例子来讲，映射为{abc：abc，bac，acb}。

代码：

class Solution:
    # @param strs, a list of strings
    # @return a list of strings
    def anagrams(self, strs):
        dict = {}
        for word in strs:
            sortedword = ''.join(sorted(word))
            dict[sortedword] = [word] if sortedword not in dict else dict[sortedword] + [word]
        res = []
        for item in dict:
            if len(dict[item]) >= 2:
                res += dict[item]
        return res