-
Notifications
You must be signed in to change notification settings - Fork 20
/
GroupAnagrams.go
57 lines (46 loc) · 909 Bytes
/
GroupAnagrams.go
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
48
49
50
51
52
53
54
55
56
57
package GroupAnagrams
import (
"strconv"
"sort"
)
//Given an array of strings, group anagrams together.
//
//For example, given: ["eat", "tea", "tan", "ate", "nat", "bat"],
//Return:
//
//[
//["ate", "eat","tea"],
//["nat","tan"],
//["bat"]
//]
//Note: All inputs will be in lower-case.
//
//Accepted.
func groupAnagrams(strs []string) [][]string {
results := make([][]string, 0)
strsLength := len(strs)
if strsLength == 0 {
return results
}
dict := map[string][]string{}
for _, s := range strs {
chars := []byte(s)
ints := make([]int, len(chars))
for _, ch := range chars {
ints = append(ints, int(ch))
}
sort.Ints(ints)
key := ""
for _, i := range ints {
key += strconv.Itoa(i)
}
if _, ok := dict[key]; !ok {
dict[key] = make([]string, 0)
}
dict[key] = append(dict[key], s)
}
for _, v := range dict {
results = append(results, v)
}
return results
}