leetcode: 49. Group Anagrams

Problem

# 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.

Note

  • 字符串也可以sort之,但是返回的是list型,需要借助 ”.join()恢复str型

AC

class Solution():
    def groupAnagrams(self, x):
        d = {}
        for s in x:
            key = ''.join(sorted(s))
            if key in d:
                d[key].append(s)
            else:
                d[key] = [s]
        return list(d.values())


if __name__ == '__main__':
    strs = [["ate", "eat", "tea"], ["nat", "tan"], ["bat"]]
    assert Solution().groupAnagrams(strs) == [[['ate', 'eat', 'tea']], [['nat', 'tan']], [['bat']]]
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值