Junior — Middle

Heap ma'lumotlar tuzilmasi bilan ishlash tajribangiz bormi?

sobes.tech AI

AIdan javob

Ha, men Go'da Heap ma'lumotlar tuzilmasi bilan tajribam bor. Go ning standart kutubxonasida "container/heap" paketi mavjud bo'lib, u odatda min-heap yoki max-heap uchun interfeys taqdim etadi.

Heap — bu ikkili daraxt bo'lib, u samarali tarzda eng kichik (yoki eng katta) elementni O(1) da olish va elementlarni O(log n) da qo'shish yoki o'chirish imkonini beradi.

Go'da min-heap dan foydalanish misoli:

package main

import (
    "container/heap"
    "fmt"
)

type IntHeap []int

func (h IntHeap) Len() int           { return len(h) }
func (h IntHeap) Less(i, j int) bool { return h[i] < h[j] }
func (h IntHeap) Swap(i, j int)      { h[i], h[j] = h[j], h[i] }

func (h *IntHeap) Push(x interface{}) {
    *h = append(*h, x.(int))
}

func (h *IntHeap) Pop() interface{} {
    old := *h
    n := len(old)
    x := old[n-1]
    *h = old[0 : n-1]
    return x
}

func main() {
    h := &IntHeap{2, 1, 5}
    heap.Init(h)
    heap.Push(h, 3)
    fmt.Printf("min: %d\n", (*h)[0])
    for h.Len() > 0 {
        fmt.Printf("%d ", heap.Pop(h))
    }
}

Ushbu misol min-heap yaratishni, elementlar qo'shishni va minimal elementni chiqarishni ko'rsatadi.

Oldingi Keyingi