DAY21：leetcode #49 Group Anagrams

最新推荐文章于 2025-07-08 16:26:35 发布

路人甲wttttt

最新推荐文章于 2025-07-08 16:26:35 发布

阅读量225

点赞数

CC 4.0 BY-SA版权

分类专栏：算法文章标签： leetcode python

本文链接：https://blog.youkuaiyun.com/zcy19941015/article/details/53045109

算法专栏收录该内容

76 篇文章

订阅专栏

本文介绍了一种算法，用于将给定字符串数组中的同字母异序词进行分组。例如，对于输入[eatteatanatenatbat]，程序将返回[[ateeattea],[nattan],[bat]]。该算法通过将每个单词转换为其排序后的字母组成的元组，并以此作为字典的键来实现高效分组。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Given an array of strings, group anagrams together.

For example, given: ["eat", "tea", "tan", "ate", "nat", "bat"],
Return:

[
  ["ate", "eat","tea"],
  ["nat","tan"],
  ["bat"]
]

Note: All inputs will be in lower-case.

Subscribe to see which companies asked this question

class Solution(object):
    def groupAnagrams(self, strs):
        """
        :type strs: List[str]
        :rtype: List[List[str]]
        """
        word_hash = {}
        result = []
        for string in strs:
            t = tuple(sorted(list(string)))
            if t in word_hash:
                word_hash[t].append(string)
            else:
                word_hash[t] = [string]
        for key in word_hash:
            result.append(word_hash[key])
        return result