-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path49_Group_Anagrams.swift
47 lines (34 loc) · 1.1 KB
/
49_Group_Anagrams.swift
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
47
/*
Done: 07.04.2024. Revisited: N/A
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 <= 10^4
0 <= strs[i].length <= 100
strs[i] consists of lowercase English letters.
https://leetcode.com/problems/group-anagrams/
*/
import Foundation
// Option 1. O(m * n)
func groupAnagrams(_ strs: [String]) -> [[String]] {
// sorted letters of a word (key) and array of anagrams (value)
var result = [String: [String]]()
for str in strs {
let key = String(str.sorted())
if result[key] != nil {
result[key]?.append(str)
} else {
result[key] = [str]
}
}
return result.map { $0.value }
}