github_mirrors/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-02-03 07:01:55 +08:00
Code Issues Packages Projects Releases Wiki Activity

fix(heap): add c codes

Browse Source
This commit is contained in:
reanon 2023-01-16 10:17:55 +08:00
parent c8ee075d50
commit fe524f7a76
1 changed files with 12 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

18
codes/c/chapter_heap/my_heap.c
View File

@ -20,6 +20,14 @@ void siftDown(maxHeap *h, int i);
void siftUp(maxHeap *h, int i); void siftUp(maxHeap *h, int i);
/* 构造空堆 */
maxHeap *newEmptyMaxHeap() {
// 所有元素入堆
maxHeap *h = (maxHeap *) malloc(sizeof(maxHeap));
h->size = 0;
return h;
}
/* 构造函数，根据切片建堆 */ /* 构造函数，根据切片建堆 */
maxHeap *newMaxHeap(int nums[], int size) { maxHeap *newMaxHeap(int nums[], int size) {
// 所有元素入堆 // 所有元素入堆
@ -107,12 +115,11 @@ int poll(maxHeap *h) {
/* 从结点 i 开始，从顶至底堆化 */ /* 从结点 i 开始，从顶至底堆化 */
void siftDown(maxHeap *h, int i) { void siftDown(maxHeap *h, int i) {
int l, r, max;
while (true) { while (true) {
// 判断结点 i, l, r 中值最大的结点，记为 max // 判断结点 i, l, r 中值最大的结点，记为 max
l = left(h, i); int l = left(h, i);
r = right(h, i); int r = right(h, i);
max = i; int max = i;
if (l < size(h) && h->data[l] > h->data[max]) { if (l < size(h) && h->data[l] > h->data[max]) {
max = l; max = l;
} }
@ -132,10 +139,9 @@ void siftDown(maxHeap *h, int i) {
/* 从结点 i 开始，从底至顶堆化 */ /* 从结点 i 开始，从底至顶堆化 */
void siftUp(maxHeap *h, int i) { void siftUp(maxHeap *h, int i) {
int p;
while (true) { while (true) {
// 获取结点 i 的父结点 // 获取结点 i 的父结点
p = parent(h, i); int p = parent(h, i);
// 当“越过根结点”或“结点无需修复”时，结束堆化 // 当“越过根结点”或“结点无需修复”时，结束堆化
if (p < 0 || h->data[i] <= h->data[p]) { if (p < 0 || h->data[i] <= h->data[p]) {
break; break;