[Leetcode] 49. Group Anagrams_Medium

最新推荐文章于 2025-09-11 19:19:55 发布

weixin_30482383

最新推荐文章于 2025-09-11 19:19:55 发布

阅读量49

点赞数

CC 4.0 BY-SA版权

文章标签：数据结构与算法

原文链接：http://www.cnblogs.com/Johnsonxiong/p/9206907.html

本文介绍了一种使用Python实现的高效算法，该算法能够将一组字符串中的字谜进行分组。通过利用collections.defaultdict()创建字典并将相同模式的字符串归类在一起，最终返回所有分组结果。文章还附带了作者对于面试准备的一些建议。

Given an array of strings, group anagrams together.

Example:

Input: ["eat", "tea", "tan", "ate", "nat", "bat"],
Output:
[
  ["ate","eat","tea"],
  ["nat","tan"],
  ["bat"]
]

Note:

All inputs will be in lowercase.
The order of your output does not matter.

题目思路为利用collections.defualtdict() 去创建diction, 将相同模型的都append进去, 最后返回diction的所有values. 只是几个小细节要注意, 一个是diction不能以list作为key, 另外返回d.values()要加list.

class Solution:
    def groupAnagrams(self, strs):
        """
        :type strs: List[str]
        :rtype: List[List[str]]
        """
        #strs = set(strs)  # 问面试官, 如果有duplicates如何处理
        d = collections.defaultdict(list)
        for s in strs:
            template = [0]*26 #题目说只有lowcase
            for c in s:
                template[ord(c) - ord('a')] += 1
            d[tuple(template)].append(s)   # 注意加上tuple
        return list(d.values())  # 注意加上list

Thanks for your reply about the Interview details. I've received the email and will follow the instructions in it. At same time, is it possible to set a phone call with you or Dan Corslund that you mentioned in your last email to discuss more about the preparation of the interviews except the coding part?

I am excited for the coming interviews and see you all there.

Best regards,

Johnson

转载于:https://www.cnblogs.com/Johnsonxiong/p/9206907.html