add solution task #347

Author: dmitryburov

README.md

@@ -265,4 +265,5 @@
   - [X] [1. Two Sum](sprint_leetcode/1)
   - [X] [19. Remove Nth Node From End of List](sprint_leetcode/19)
   - [X] [155. Min Stack](sprint_leetcode/155)
+  - [X] [347. Top K Frequent Elements](sprint_leetcode/347)
 </details>

sprint_leetcode/347/README.md

@@ -0,0 +1,3 @@
+# 347. Top K Frequent Elements
+
+Подробнее о задаче: [Тыц](https://leetcode.com/problems/min-stack/)

sprint_leetcode/347/solution.go

@@ -0,0 +1,27 @@
+package main
+
+import "sort"
+
+func topKFrequent(nums []int, k int) []int {
+	var hMap = make(map[int]int)
+	for i := 0; i < len(nums); i++ {
+		hMap[nums[i]] += 1
+	}
+
+	var d = 0
+	keys := make([]int, len(hMap))
+	for key := range hMap {
+		keys[d] = key
+		d++
+	}
+	sort.Slice(keys, func(a, b int) bool {
+		return hMap[keys[a]] > hMap[keys[b]]
+	})
+
+	var result = make([]int, k)
+	for i := 0; i < len(keys) && i < k; i++ {
+		result[i] = keys[i]
+	}
+
+	return result
+}

sprint_leetcode/347/solution_test.go

@@ -0,0 +1,47 @@
+package main
+
+import (
+	"fmt"
+	"reflect"
+	"testing"
+)
+
+type TestItemInput struct {
+	arr []int
+	k   int
+}
+
+type TestItem struct {
+	input  TestItemInput
+	output []int
+}
+
+func TestTask(t *testing.T) {
+	for i, v := range generateTasks() {
+		t.Run(fmt.Sprintf("Test %d", i+1), func(t *testing.T) {
+			res := topKFrequent(v.input.arr, v.input.k)
+			if !reflect.DeepEqual(res, v.output) {
+				t.Errorf("Wrong test.\nOutput: \n%v \nExpected: \n%v", res, v.output)
+			}
+		})
+	}
+}
+
+func generateTasks() []TestItem {
+	return []TestItem{
+		{
+			input: TestItemInput{
+				arr: []int{1, 1, 1, 2, 2, 3},
+				k:   2,
+			},
+			output: []int{1, 2},
+		},
+		{
+			input: TestItemInput{
+				arr: []int{1, 1, 2, 4, 1, 3, 3, 4, 10},
+				k:   3,
+			},
+			output: []int{1, 4, 3},
+		},
+	}
+}