mirror of
https://github.com/halfrost/LeetCode-Go.git
synced 2025-08-03 02:47:26 +08:00
57 lines
1.1 KiB
Go
57 lines
1.1 KiB
Go
package leetcode
|
||
|
||
import "container/heap"
|
||
|
||
func topKFrequent(nums []int, k int) []int {
|
||
m := make(map[int]int)
|
||
for _, n := range nums {
|
||
m[n]++
|
||
}
|
||
q := PriorityQueue{}
|
||
for key, count := range m {
|
||
heap.Push(&q, &Item{key: key, count: count})
|
||
}
|
||
var result []int
|
||
for len(result) < k {
|
||
item := heap.Pop(&q).(*Item)
|
||
result = append(result, item.key)
|
||
}
|
||
return result
|
||
}
|
||
|
||
// Item define
|
||
type Item struct {
|
||
key int
|
||
count int
|
||
}
|
||
|
||
// A PriorityQueue implements heap.Interface and holds Items.
|
||
type PriorityQueue []*Item
|
||
|
||
func (pq PriorityQueue) Len() int {
|
||
return len(pq)
|
||
}
|
||
|
||
func (pq PriorityQueue) Less(i, j int) bool {
|
||
// 注意：因为golang中的heap是按最小堆组织的，所以count越大，Less()越小，越靠近堆顶.
|
||
return pq[i].count > pq[j].count
|
||
}
|
||
|
||
func (pq PriorityQueue) Swap(i, j int) {
|
||
pq[i], pq[j] = pq[j], pq[i]
|
||
}
|
||
|
||
// Push define
|
||
func (pq *PriorityQueue) Push(x interface{}) {
|
||
item := x.(*Item)
|
||
*pq = append(*pq, item)
|
||
}
|
||
|
||
// Pop define
|
||
func (pq *PriorityQueue) Pop() interface{} {
|
||
n := len(*pq)
|
||
item := (*pq)[n-1]
|
||
*pq = (*pq)[:n-1]
|
||
return item
|
||
}
|