【数据结构05】堆

堆是算法刷题当中经常用到的数据结构，用C++甚至只需要一个set就行，但是我们最好还是知道堆的具体实现方式，心底才不至于空落落的。

/*************************************************************************
        > File Name: heap.c
        > Author: jby
        > Mail: 
        > Created Time: Sun 16 Jul 2023 06:01:43 PM CST
 ************************************************************************/

#include<stdio.h>
#include<stdlib.h>
#include<time.h>

#define swap(a, b) { \
    __typeof(a) __tmp = a; \
    a = b; b = __tmp; \
}

typedef struct Heap {
    int *data;
    int size;
    int len;
} 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 *h) {
    if (!h) return ;
    free(h->data);
    free(h);
    return ;
}

int push(Heap *h, int val) {
    if (!h) return 0;
    if (h->size == h->len) return 0;
    h->data[h->len] = val;

    // 调整新插入的数据的位置
    int idx = h->len;
    while (idx > 0 && h->data[idx] > h->data[(idx - 1) / 2]) {
        swap(h->data[idx], h->data[(idx - 1) / 2]);
        idx = (idx - 1) / 2;
    }
    h->len++;
    return 1;
}

void downAdj(int *arr, int idx, int len) {
    while (idx * 2 + 1 < len) {
        int tmp = idx, l = idx * 2 + 1, r = idx * 2 + 2;
        if (arr[l] > arr[tmp]) {
            tmp = l;
        }
        if (r < len && arr[r] > arr[tmp]) {
            tmp = r;
        }
        // 如果父节点就是最大的，堆已经平衡了
        if (tmp == idx) break;
        // 交换父节点和最大孩子的值
        swap(arr[tmp], arr[idx]);
        //记录父节点当前的位置
        idx = tmp;
    }
}

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

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;
}

void showHeap(Heap *h) {
    printf("Heap:[");
    for (int i = 0; i < h->len; i++) {
        i && printf(", ");
        printf("%d", h->data[i]);
    }
    printf("]\n");
    return ;
}
int main () {
    srand(time(0));
    #define HEAPLEN 10
    Heap *h = initHeap(HEAPLEN);
    int cnt = HEAPLEN;
    while (cnt--) {
        int val = rand() % 100;
        push(h, val);
    }
    showHeap(h);
    printf("pop:[");
    while (!isEmpty(h)) {
        printf("%d ", pop(h));
    }
    printf("]\n");
    #undef HEAPLEN
    freeHeap(h);
    return 0;
}