[49. Group Anagrams] #leetcode

49_1014.py

class Solution(object):
  # O(nlgn*k) O(n*k)
    def groupAnagrams(self, strs):
        """
        :type strs: List[str]
        :rtype: List[List[str]]
        """
        groups = dict()
        res = []
        
        for s in strs:
            sortedStr = "".join(sorted(s))
            if sortedStr not in groups:
                groups[sortedStr] = list()
            groups[sortedStr].append(s)
        
        return [v for _, v in groups.items()]
    

class Solution:
  # O(n*k) 
    def groupAnagrams(strs):
        ans = collections.defaultdict(list)
        for s in strs:
            count = [0] * 26
            for c in s:
                count[ord(c) - ord('a')] += 1
            ans[tuple(count)].append(s)
        return ans.values()