C语言实现大顶堆

代码

#include <stdio.h>
#include <stdlib.h>
#define swap(a,b) {\
    __typeof(a) __tmp=a;\
    a=b, b=__tmp;\
}

typedef struct Heap { //大顶堆 完全二叉树
    int *data, size, len; //data线性
} Heap;

Heap *initHeap(int n) {
    Heap *h = (Heap *)malloc(sizeof(Heap));
    h->data = (int *)malloc(sizeof(int) * n);
    h->size = n, h->len = 0;
    return h;
}

void freeHeap(Heap *p) {
    if (!p) return ;
    free(p->data);
    free(p);
    return ;
}

int push(Heap *h, int val) { //尾部插入数据
    if (!h || h->size == h->len) return 0;
    h->data[h->len] = val;

    //调整插入位置
    int ind = h->len; //ind-当前节点 (ind-1)/2-父结点
    while (ind > 0 && h->data[ind] > h->data[(ind - 1) / 2]) {
        swap(h->data[ind], h->data[(ind - 1) / 2]);
        ind = (ind - 1) / 2;
    }

    ++h->len;
    return 1;
}

void downAdj(int *arr, int ind, int len) { //向下调整
    while (ind * 2 + 1 < len) { //左孩子存在
        int tmp = ind; //tmp记录父节点及左右孩子这3个节点最大的那个小标
        int l = ind * 2 + 1, r = ind * 2 + 2;  //l-左孩子 r-右孩子
        if (arr[l] > arr[tmp]) tmp = l;
        if (r < len && arr[r] > arr[tmp]) tmp = r;

        if (tmp == ind) break;
        swap(arr[tmp], arr[ind]);
        ind = tmp;
    }
    return ;
}

int isEmpty(Heap *h) {
    return !h || !h->len;
}

int pop(Heap *h) { //弹出大顶堆堆顶的元素
    int ret = h->data[0];
    h->data[0] = h->data[h->len - 1];
    --h->len;

    downAdj(h->data, 0, h->len);
    return ret;
}

int main() {
    return 0;
}