accepted problem 49

Author: aQua

Algorithms/0049.group-anagrams/README.md

@@ -1,8 +1,17 @@
 # [49. Group Anagrams](https://leetcode.com/problems/group-anagrams/)
 
 ## 题目
+Given an array of strings, group anagrams together.
+```
+For example, given: ["eat", "tea", "tan", "ate", "nat", "bat"], 
+Return:
 
-
+[
+  ["ate", "eat","tea"],
+  ["nat","tan"],
+  ["bat"]
+]
+```
 ## 解题思路
 
 

Algorithms/0049.group-anagrams/group-anagrams.go

@@ -1,2 +1,38 @@
 package Problem0049
 
+import (
+	"sort"
+)
+
+func groupAnagrams(strs []string) [][]string {
+	res := [][]string{}
+	record := make(map[string][]string)
+
+	for _, str := range strs {
+		temp := sortString(str)
+		record[temp] = append(record[temp], str)
+	}
+	for _, v := range record {
+		sort.Strings(v)
+		res = append(res, v)
+	}
+
+	return res
+}
+
+func sortString(s string) string {
+	bytes := []byte(s)
+
+	temp := make([]int, len(bytes))
+	for i, b := range bytes {
+		temp[i] = int(b)
+	}
+
+	sort.Ints(temp)
+
+	for i, v := range temp {
+		bytes[i] = byte(v)
+	}
+
+	return string(bytes)
+}

Algorithms/0049.group-anagrams/group-anagrams_test.go

@@ -1,8 +1,8 @@
 package Problem0049
 
 import (
-	"testing"
 	"fmt"
+	"testing"
 
 	"github.com/stretchr/testify/assert"
 )
@@ -15,13 +15,13 @@ type question struct {
 // para 是参数
 // one 代表第一个参数
 type para struct {
-	one string
+	one []string
 }
 
 // ans 是答案
 // one 代表第一个答案
 type ans struct {
-	one string
+	one [][]string
 }
 
 func Test_Problem0049(t *testing.T) {
@@ -30,17 +30,21 @@ func Test_Problem0049(t *testing.T) {
 	qs := []question{
 
 		question{
-			para{""},
-			ans{""},
+			para{[]string{"eat", "tea", "tan", "ate", "nat", "bat"}},
+			ans{[][]string{
+				[]string{"ate", "eat", "tea"},
+				[]string{"nat", "tan"},
+				[]string{"bat"},
+			}},
 		},
-	
+
 		// 如需多个测试，可以复制上方元素。
 	}
 
 	for _, q := range qs {
 		a, p := q.ans, q.para
 		fmt.Printf("~~%v~~\n", p)
 
-		ast.Equal(a.one, (p.one), "输入:%v", p)
+		ast.Equal(a.one, groupAnagrams(p.one), "输入:%v", p)
 	}
 }