Merge pull request algorithm007-class02#343 from AndrewOYLK/master

melody-li · web-flow · commit fe7e0d44e1e0 · 2020-03-24T11:55:12.000+08:00
0032_week02(go)
diff --git a/Week_02/G20200343040032/LeetCode_242_0032.go b/Week_02/G20200343040032/LeetCode_242_0032.go
@@ -0,0 +1,20 @@
+package g20200343040032
+
+import "fmt"
+
+func isAnagram(s string, t string) bool {
+	a := [26]int{}
+	b := [26]int{}
+
+	for _, v := range s {
+		a[v-'a'] += 1
+	}
+
+	for _, v := range t {
+		b[v-'a'] += 1
+	}
+
+	fmt.Printf("a=%v\nb=%v\n", a, b)
+
+	return a == b
+}
diff --git a/Week_02/G20200343040032/LeetCode_49_0032.go b/Week_02/G20200343040032/LeetCode_49_0032.go
@@ -0,0 +1,33 @@
+package g20200343040032
+
+import "sort"
+
+func groupAnagrams(strs []string) [][]string {
+	if strs == nil || len(strs) == 0 {
+		return [][]string{}
+	}
+	rMap := make(map[string][]int, 0)
+	for i, v := range strs {
+		str := aSort(v)
+		if _, ok := rMap[str]; !ok {
+			rMap[str] = []int{i}
+		} else {
+			rMap[str] = append(rMap[str], i)
+		}
+	}
+	res := make([][]string, 0)
+	for _, v := range rMap {
+		a := make([]string, 0)
+		for _, x := range v {
+			a = append(a, strs[x])
+		}
+		res = append(res, a)
+	}
+	return res
+}
+
+func aSort(s string) string {
+	x := []byte(s)
+	sort.Slice(x, func(i, j int) bool { return x[i] < x[j] })
+	return string(x)
+}
