add 374 solution

6boris · 6boris · commit 7a71b7aad670 · 2020-07-17T18:33:30.000+08:00
diff --git a/src/0347.Top-K-Frequent-Elements/Solution.go b/src/0347.Top-K-Frequent-Elements/Solution.go
@@ -1,5 +1,26 @@
 package Solution
 
-func Solution(x bool) bool {
-	return x
+import "sort"
+
+func topKFrequent(nums []int, k int) []int {
+	tmp := make(map[int]int)
+	res := []int{}
+	s := [][]int{}
+	//	统计每个字符出现次数
+	for _, v := range nums {
+		tmp[v]++
+	}
+	//	保存 数字/次数 映射  i,v 数字，次数
+	for i, v := range tmp {
+		s = append(s, []int{i, v})
+	}
+	//	按照次数排序
+	sort.Slice(s, func(a, b int) bool {
+		return s[a][1] > s[b][1]
+	})
+	//	截取前k个
+	for i := 0; i < k; i++ {
+		res = append(res, s[i][0])
+	}
+	return res
 }
diff --git a/src/0347.Top-K-Frequent-Elements/Solution_test.go b/src/0347.Top-K-Frequent-Elements/Solution_test.go
@@ -10,21 +10,21 @@ func TestSolution(t *testing.T) {
 	//	测试用例
 	cases := []struct {
 		name   string
-		inputs bool
-		expect bool
+		input1 []int
+		input2 int
+		expect []int
 	}{
-		{"TestCase", true, true},
-		{"TestCase", true, true},
-		{"TestCase", false, false},
+		{"TestCase", []int{1, 1, 1, 2, 2, 3}, 2, []int{1, 2}},
+		{"TestCase", []int{1}, 1, []int{1}},
 	}
 
 	//	开始测试
 	for i, c := range cases {
 		t.Run(c.name+" "+strconv.Itoa(i), func(t *testing.T) {
-			got := Solution(c.inputs)
+			got := topKFrequent(c.input1, c.input2)
 			if !reflect.DeepEqual(got, c.expect) {
-				t.Fatalf("expected: %v, but got: %v, with inputs: %v",
-					c.expect, got, c.inputs)
+				t.Fatalf("expected: %v, but got: %v, with input1: %v input2: %v",
+					c.expect, got, c.input1, c.input2)
 			}
 		})
 	}
