From 7483c6ce1e431945f0dbce34187c17cea858b09b Mon Sep 17 00:00:00 2001 From: gonglja <39959756+Gonglja@users.noreply.github.com> Date: Sat, 9 Sep 2023 16:41:24 +0800 Subject: [PATCH] Fix `my_heap.c` build error (#732) * fix(codes/cpp): Memory leak fix: the space was not freed when pop removed the element. * fix(codes/cpp): Fix access error when printArray(arr, 0) * Update PrintUtil.hpp * fix(codes/c): Fix some errors of cmake build * feat(codes/c): Add hashing_search.c * styles(codes/c): Modify function description * styles(codes/c): Modify binary_search.c code style * fix(codes/c): Fix the problem in binary_tree_bfs.c and the problem that the memory is not released. * feat: Add preorder_traversal_i_compact.c * feat(codes/c): Add head_sort.c * feat(codes/c): Add bucket_sort.c * feat(codes/c): Add binary_search_edge.c * fix(codes/c): Add programs that are not managed by cmake (c code) * feat(codes/c): Add selection_sort.c * style(codes/c): Change swap in selection_sort.c to `selectionSort` * styles(codes/c): Change style. * fix(codes/c): Fix some formatting errors and temporarily remove backtracking chapters * fix(codes/c): Fix space_complexity.c build error. * feat(codes/c): Add array_binary_tree.c * feat(code/c): Update push_back and pop_back in vector.h * styles(codes/c): Adjust format. * fix(codes/c/chapter_heap): Fix my_head.c build error. --------- Co-authored-by: Yudong Jin --- codes/c/chapter_heap/my_heap.c | 4 +++- 1 file changed, 3 insertions(+), 1 deletion(-) diff --git a/codes/c/chapter_heap/my_heap.c b/codes/c/chapter_heap/my_heap.c index 1ee9e1a48..bb19196b4 100644 --- a/codes/c/chapter_heap/my_heap.c +++ b/codes/c/chapter_heap/my_heap.c @@ -22,13 +22,15 @@ void siftDown(maxHeap *h, int i); void siftUp(maxHeap *h, int i); +int parent(maxHeap *h, int i); + /* 构造函数，根据切片建堆 */ maxHeap *newMaxHeap(int nums[], int size) { // 所有元素入堆 maxHeap *h = (maxHeap *)malloc(sizeof(maxHeap)); h->size = size; memcpy(h->data, nums, size * sizeof(int)); - for (int i = parent(size - 1); i >= 0; i--) { + for (int i = parent(h, size - 1); i >= 0; i--) { // 堆化除叶节点以外的其他所有节点 siftDown(h, i); }