-
Notifications
You must be signed in to change notification settings - Fork 0
/
main.swift
33 lines (25 loc) · 895 Bytes
/
main.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
/**
49. Group Anagrams
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.
Time complexity: O(c * logc * s)
Space complexity: O(s * c)
*/
class Solution {
func groupAnagrams(_ strs: [String]) -> [[String]] {
var dict = [String: [String]]()
for str in strs {
let sortedStr = String(str.sorted())
if dict[sortedStr] != nil {
dict[sortedStr]?.append(str)
} else{
dict[sortedStr] = [str]
}
}
var result = [[String]]()
for (key, value) in dict {
result.append(value)
}
return result
}
}