-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathGroup Anagrams.py
More file actions
46 lines (43 loc) · 1.2 KB
/
Group Anagrams.py
File metadata and controls
46 lines (43 loc) · 1.2 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
# https://leetcode.com/problems/group-anagrams/
# Hak Soo Kim
# 1/5/2022
class Solution(object):
def groupAnagrams(self, strs):
ans = collections.defaultdict(list)
for word in strs:
sortedWord = tuple(sorted(word))
ans[sortedWord].append(word)
return ans.values()
"""
:type strs: List[str]
:rtype: List[List[str]]
"""
## better way
# hmap = collections.defaultdict(list)
# for st in strs:
# array = [0] * 26
# for l in st:
# array[ord(l) - ord('a')] += 1
# hmap[tuple(array)].append(s )
# return hmap.values()
# Given an array of strings strs, group the anagrams together. You can return the answer in any order.
#
# An Anagram is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once.
#
# Example 1:
#
# Input: strs = ["eat","tea","tan","ate","nat","bat"]
# Output: [["bat"],["nat","tan"],["ate","eat","tea"]]
# Example 2:
#
# Input: strs = [""]
# Output: [[""]]
# Example 3:
#
# Input: strs = ["a"]
# Output: [["a"]]
# Constraints:
#
# 1 <= strs.length <= 104
# 0 <= strs[i].length <= 100
# strs[i] consists of lowercase English letters.