堆資料結構

來源:互聯網
上載者:User

標籤:

以下是小根堆定義,包括向堆中插入元素,刪除堆中元素,建立新堆,調整堆等函數。

typedef int Elemtype;class MinHeap{public:    MinHeap() :elem(0), size(0){}    void BuildMinHeap(vector<Elemtype> v);    void Modify(int i);    int Delete();    void Insert(Elemtype e);private:    vector<Elemtype> elem;    int size;};void MinHeap::BuildMinHeap(vector<Elemtype> v){    elem = v;    size = v.size();    int i = size / 2;    while (i > 0){        Modify(i);        i--;    }}void MinHeap::Modify(int i){    Elemtype temp = elem[i];    int parent, child;    for (parent = i; parent * 2 <= size; parent = child){        child = parent * 2;        if (child + 1 <= size&&elem[child + 1] < elem[child])            child++;        if (elem[child] > temp)            break;        else            elem[parent] = elem[child];    }    elem[parent] = temp;}void MinHeap::Insert(Elemtype e){    elem.push_back(e);    int i;    i = ++size;    for (; elem[i / 2] > e; i /= 2){        elem[i] = elem[i / 2];    }    elem[i] = e;}int MinHeap::Delete(){    Elemtype temp = elem[1];    elem[1] = elem[size--];    elem.pop_back();    Modify(1);    return temp;}

 

堆資料結構

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.