We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 2897867 commit 164b56bCopy full SHA for 164b56b
top-k-frequent-elements/changchanghwang.go
@@ -8,8 +8,8 @@ func topKFrequent(nums []int, k int) []int {
8
9
result := [][]int{}
10
11
- for key, value := range hashMap {
12
- result = append(result, []int{key, value})
+ for num, count := range hashMap {
+ result = append(result, []int{num, count})
13
}
14
15
sort.Slice(result, func(i, j int) bool { // go의 sort는 quicksort를 기본적으로 사용한다. O(nlogn)
@@ -18,7 +18,7 @@ func topKFrequent(nums []int, k int) []int {
18
19
resultNums := []int{}
20
for i := 0; i < k; i++ {
21
- resultNums = append(resultNums, result[i][0])
+ resultNums = append(resultNums, result[i][0]) // 정렬을 했기 때문에 앞에서부터 k개만 뽑아내면 된다.
22
23
24
return resultNums[:k]
0 commit comments