-
Notifications
You must be signed in to change notification settings - Fork 12.2k
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
add avl tree and heap part cpp code (#320)
* 将avl_tree翻译成c++代码(文档明天补) * markdown翻译了 * avl_tree.cpp翻译了 * 堆的cpp翻译 * modify the code format * Update heap.md --------- Co-authored-by: Yudong Jin <krahets@163.com>
- Loading branch information
1 parent
7c81f8c
commit e5ae3e1
Showing
5 changed files
with
800 additions
and
107 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
|
@@ -63,4 +63,4 @@ int main() | |
cout << "输入列表并建立小顶堆后" << endl; | ||
PrintUtil::printHeap(minHeap); | ||
return 0; | ||
} | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,170 @@ | ||
#include "../include/include.hpp" | ||
|
||
/* 最大堆类 */ | ||
class MaxHeap { | ||
private: | ||
// 使用 vector 而非数组,这样无需考虑扩容问题 | ||
vector<int> maxHeap; | ||
|
||
/* 获取左子结点索引 */ | ||
int left(int i) { | ||
return 2 * i + 1; | ||
} | ||
|
||
/* 获取右子结点索引 */ | ||
int right(int i) { | ||
return 2 * i + 2; | ||
} | ||
|
||
/* 获取父结点索引 */ | ||
int parent(int i) { | ||
return (i - 1) / 2; // 向下整除 | ||
} | ||
|
||
/* 交换元素 */ | ||
void swap(int i, int j) { | ||
int a = maxHeap[i], | ||
b = maxHeap[j], | ||
tmp = a; | ||
maxHeap[i] = b; | ||
maxHeap[j] = tmp; | ||
} | ||
|
||
/* 从结点 i 开始,从底至顶堆化 */ | ||
void siftUp(int i) { | ||
while (true) { | ||
// 获取结点 i 的父结点 | ||
int p = parent(i); | ||
// 当“越过根结点”或“结点无需修复”时,结束堆化 | ||
if (p < 0 || maxHeap[i] <= maxHeap[i]) | ||
break; | ||
// 交换两结点 | ||
swap(i, p); | ||
// 循环向上堆化 | ||
i = p; | ||
} | ||
} | ||
|
||
/* 从结点 i 开始,从顶至底堆化 */ | ||
void siftDown(int i) { | ||
while (true) { | ||
// 判断结点 i, l, r 中值最大的结点,记为 ma | ||
int l = left(i), r = right(i), ma = i; | ||
if (l < size() && maxHeap[l] > maxHeap[ma]) | ||
ma = l; | ||
if (r < size() && maxHeap[r] > maxHeap[ma]) | ||
ma = r; | ||
// 若结点 i 最大或索引 l, r 越界,则无需继续堆化,跳出 | ||
if (ma == i) break; | ||
// 交换两结点 | ||
swap(i, ma); | ||
// 循环向下堆化 | ||
i = ma; | ||
} | ||
} | ||
|
||
public: | ||
/* 构造函数,建立空堆 */ | ||
MaxHeap() = default; | ||
|
||
/* 构造函数,根据输入列表建堆 */ | ||
MaxHeap(vector<int> nums) { | ||
// 将列表元素原封不动添加进堆 | ||
maxHeap = nums; | ||
// 堆化除叶结点以外的其他所有结点 | ||
for (int i = parent(size() - 1); i >= 0; i--) { | ||
siftDown(i); | ||
} | ||
} | ||
|
||
/* 获取堆大小 */ | ||
int size() { | ||
return maxHeap.size(); | ||
} | ||
|
||
/* 判断堆是否为空 */ | ||
bool isEmpty() { | ||
return size() == 0; | ||
} | ||
|
||
/* 访问堆顶元素 */ | ||
int peek() { | ||
return maxHeap.front(); | ||
} | ||
|
||
/* 元素入堆 */ | ||
void push(int val) { | ||
// 添加结点 | ||
maxHeap.push_back(val); | ||
// 从底至顶堆化 | ||
siftUp(size() - 1); | ||
} | ||
|
||
/* 元素出堆 */ | ||
int poll() { | ||
// 判空处理 | ||
if (isEmpty()) | ||
throw out_of_range("堆已空\n"); | ||
// 交换根结点与最右叶结点(即交换首元素与尾元素) | ||
swap(0, size() - 1); | ||
// 删除结点 | ||
int val = maxHeap.back(); | ||
maxHeap.pop_back(); | ||
// 从顶至底堆化 | ||
siftDown(0); | ||
// 返回堆顶元素 | ||
return val; | ||
} | ||
|
||
/* 打印堆(二叉树) */ | ||
void print() { | ||
cout << "堆的数组表示:" << endl; | ||
PrintUtil::printVector(this->maxHeap); | ||
cout << "堆的树状表示:" << endl; | ||
TreeNode *tree = vecToTree(this->maxHeap); | ||
PrintUtil::printTree(tree); | ||
freeMemoryTree(tree); | ||
} | ||
}; | ||
|
||
void testPush(MaxHeap &maxHeap, int val) { | ||
maxHeap.push(val); // 元素入堆 | ||
cout << "\n添加元素 " << val << " 后" << endl; | ||
maxHeap.print(); | ||
} | ||
|
||
void testPoll(MaxHeap &maxHeap) { | ||
int val = maxHeap.poll(); // 堆顶元素出堆 | ||
cout << "出堆元素为 " << val << endl; | ||
maxHeap.print(); | ||
} | ||
|
||
int main() { | ||
/* 初始化大顶堆 */ | ||
MaxHeap maxHeap({9, 8, 6, 6, 7, 5, 2, 1, 4, 3, 6, 2}); | ||
cout << "\n输入列表并建堆后" << endl; | ||
maxHeap.print(); | ||
|
||
/* 获取堆顶元素 */ | ||
int peek = maxHeap.peek(); | ||
cout << "\n堆顶元素为 " << peek << endl; | ||
|
||
/* 元素入堆 */ | ||
int val = 7; | ||
maxHeap.push(val); | ||
cout << "\n元素 " << val << " 入堆后" << endl; | ||
maxHeap.print(); | ||
|
||
/* 堆顶元素出堆 */ | ||
peek = maxHeap.poll(); | ||
cout << "\n堆顶元素 " << peek << " 出堆后" << endl; | ||
maxHeap.print(); | ||
|
||
/* 获取堆大小 */ | ||
int size = maxHeap.size(); | ||
cout << "\n堆元素数量为 " << size << endl; | ||
|
||
/* 判断堆是否为空 */ | ||
bool isEmpty = maxHeap.isEmpty(); | ||
cout << "\n堆是否为空 " << isEmpty << endl; | ||
} |
Oops, something went wrong.