-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathgroupAnagram.js
More file actions
31 lines (23 loc) · 842 Bytes
/
groupAnagram.js
File metadata and controls
31 lines (23 loc) · 842 Bytes
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
// 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"]]
// my solution
var groupAnagrams = function (strs) {
const anagramsMap = new Map();
for (const str of strs) {
const sortedStr = str.split("").sort().join("");
if (!anagramsMap.has(sortedStr)) {
anagramsMap.set(sortedStr, []);
}
anagramsMap.get(sortedStr).push(str);
}
return Array.from(anagramsMap.values());
};