[Leetcode]49. Group Anagrams
📄 Description
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. 💻 My Submision
class Solution:
def groupAnagrams(self, strs: List[str]) -> List[List[str]]:
anagrams=defaultdict(list)
for word in strs:
anagrams[''.join(sorted(word))].append(word)
return anagrams.values()💡 What I learned
sort()関数は、リストだけでなく、文字列、数値もソートできます.References
Reference
この問題について([Leetcode]49. Group Anagrams), 我々は、より多くの情報をここで見つけました https://velog.io/@limelimejiwon/Leetcode49.-Group-Anagramsテキストは自由に共有またはコピーできます。ただし、このドキュメントのURLは参考URLとして残しておいてください。
Collection and Share based on the CC Protocol