//C++動(dòng)態(tài)數(shù)組簡(jiǎn)單的模擬二元堆 #include<iostream>using namespace std;class BinaryHeap { private:int cap; //該陣列的最大容量int size; //當(dāng)前元素個(gè)數(shù)int* datas; //數(shù)組首地址 public:explicit BinaryHeap(int cap_) :cap(cap_), size(0){datas = new int[cap];}~BinaryHeap(){ delete datas; }void Insert(int);int DeleteMin(); };//用數(shù)組表示的樹(shù)，當(dāng)下標(biāo)從0開(kāi)始時(shí)，i為當(dāng)前節(jié)點(diǎn)，i*2+1為i的左子樹(shù)節(jié)點(diǎn)，i*2+2為i的右子樹(shù)節(jié)點(diǎn)，i/2為i的父節(jié)點(diǎn)void BinaryHeap::Insert(int data) {int i;for (i = size; i / 2 >= 0 && datas[i / 2] > data; i /= 2) //上濾{datas[i] = datas[i / 2];}datas[i] = data;size++; }int BinaryHeap::DeleteMin() {int i = 0, child = 0;int lastdata = datas[--size];int mindata = datas[0];for (i = 0; i * 2 + 1 <= size-1; i = child) //下濾{child = i * 2 + 1;if (child < size-1 && datas[child + 1] < datas[child]){child++;}if (lastdata > datas[child]){datas[i] = datas[child];}else{break;}}datas[i] = lastdata;return mindata; }int main() {BinaryHeap t(400);for (int i = 0; i < 100; i++)t.Insert(i);for (int i = 200; i > 100; i--)t.Insert(i);for (int i = 0; i < 200; i++)cout << t.DeleteMin() << endl;cin.get();return 0; }

版權(quán)聲明：本文博主原創(chuàng)文章，博客，未經(jīng)同意不得轉(zhuǎn)載。

轉(zhuǎn)載于:https://www.cnblogs.com/gcczhongduan/p/4906768.html

總結(jié)

以上是生活随笔為你收集整理的C++动态数组简单的模拟二元堆的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問(wèn)題。

如果覺(jué)得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。