最小堆的初始化、插入、根结点删除

最新推荐文章于 2022-03-07 17:46:09 发布

听窗

最新推荐文章于 2022-03-07 17:46:09 发布

阅读量878

点赞数

文章标签：链表算法数据结构

本文链接：https://blog.csdn.net/r643064456/article/details/121441739

版权

#include <iostream>
using namespace std;
class MinHeap{
    int*heap;
    int maxSize,currentSize;
public:
    MinHeap(const int*array,int maxArraySize,int currentArraySize):maxSize(maxArraySize),currentSize(currentArraySize){
        heap=new int[maxSize]();
        for (int i = 0; i < currentSize; ++i) {
            heap[i]=array[i];
        }
        int temp;
        for (int i = currentSize/2-1; i >= 0; i--) {
            for (int j = i; j <= currentSize/2-1; j++) {
                if (2*j+2<currentSize){
                    if (heap[j]>heap[2*j+1]||heap[j]>heap[2*j+2]){
                        if (heap[2*j+1]>heap[2*j+2]){
                            temp=heap[j];
                            heap[j]=heap[2*j+2];
                            heap[2*j+2]=temp;
                        } else{
                            temp=heap[j];
                            heap[j]=heap[2*j+1];
                            heap[2*j+1]=temp;
                        }
                    }
                } else{
                    if (heap[j]>heap[2*j+1]){
                        temp=heap[j];
                        heap[j]=heap[2*j+1];
                        heap[2*j+1]=temp;
                    }
                }
            }
        }
    }

    void InsertData(int data){
        heap[currentSize++]=data;
        int temp;
        for (int i = currentSize-1; i >0 ; i=(i-1)/2) {
            if (heap[i]<heap[(i-1)/2]){
                temp=heap[i];
                heap[i]=heap[(i-1)/2];
                heap[(i-1)/2]=temp;
            }
        }
    }

    void DeleteTopData(){
        heap[0]=heap[currentSize---1];
        int temp;
        for (int j = 0; j <= currentSize/2-1; j++) {
            if (2*j+2<currentSize){
                if (heap[j]>heap[2*j+1]||heap[j]>heap[2*j+2]){
                    if (heap[2*j+1]>heap[2*j+2]){
                        temp=heap[j];
                        heap[j]=heap[2*j+2];
                        heap[2*j+2]=temp;
                    } else{
                        temp=heap[j];
                        heap[j]=heap[2*j+1];
                        heap[2*j+1]=temp;
                    }
                }
            } else{
                if (heap[j]>heap[2*j+1]){
                    temp=heap[j];
                    heap[j]=heap[2*j+1];
                    heap[2*j+1]=temp;
                }
            }
        }
    }

    void PrintHeap(){
        for (int i = 0; i < currentSize; ++i) {
            cout<<heap[i]<<' ';
        }
        cout<<endl;
    }
};

int main() {
    int a[10]={20,12,35,15,10,80,30,17,2,1};
    MinHeap*minHeap=new MinHeap(a,100,10);
    minHeap->PrintHeap();
    minHeap->InsertData(0);
    minHeap->PrintHeap();
    minHeap->DeleteTopData();
    minHeap->PrintHeap();
    return 0;
}