堆和优先级队列

来源：互联网发布：免费录音机软件下载编辑：程序博客网时间：2024/06/05 17:44

vs2013下编写的项目工程见我的 github: https://github.com/excelentone/DataStruct

heap.h

#include<iostream>#include<cassert>#include <vector>using namespace std;template<class T>struct Less{    bool operator()(const T&left, const T &right)    {        return left < right;    }};template<class T>struct Greater{    bool operator()(const T&left, const T&right)    {        return left>right;    }};//template<class T,class Compare=Less<T> >template<class T, template<class T> class Compare = Less >class Heap{public:    // ´´½¨Ò»¸ö¿Õ¶Ñ    Heap()    {}    Heap(const T array[], size_t size)    {        _heap.resize(size);        for (size_t i = 0; i < size; i++)        {            _heap[i] = array[i];        }        AdjustDown();    }    void AdjustDown()    {        int flag = (_heap.size() - 2) / 2;        for (int i = flag; i >= 0; i--)        {            _AdjustDown(i);        }    }    size_t Size()const    {        return _heap.size();    }    bool Empty()const    {        return _heap.empty();    }    void Insert(const T& data)    {        _heap.push_back(data);        _AdjustUp(_heap.size() - 1);    }    void Remove()    {        assert(_heap.size() != 0);        swap(_heap[0], _heap[_heap.size() - 1]);        _heap.pop_back();        AdjustDown();    }    void Print()    {        for (size_t i = 0; i < _heap.size(); i++)        {            cout << _heap[i] << " ";        }        cout << endl;    }    const T &Top()    {        return _heap[0];    }protected:    void _AdjustDown(size_t parent)    {        int child = 2 * parent + 1;        Compare<T> com;        while (child <= _heap.size())        {            if (((child + 1) < _heap.size()) && com(_heap[child + 1], _heap[child]))            {                child += 1;            }            if (com(_heap[child], _heap[parent]))            {                swap(_heap[parent], _heap[child]);                parent = child;                child = 2 * parent + 1;            }            else            {                break;            }        }    }    void _AdjustUp(size_t child)    {        int parent = (child - 1) / 2;        while (child > 0)        {            if (Compare<T>()(_heap[child], _heap[parent]))            {                swap(_heap[child], _heap[parent]);                child = parent;                parent = (child - 1) / 2;            }            else                break;        }    }protected:    vector<T> _heap;};

PriorityQueue.cpp

#include"Heap.h"template<class T, class Compare = Less<T>>class PriorityQueue{public:    PriorityQueue() :_hp()    {}    PriorityQueue(T *arr, size_t size) :_hp(arr, size)    {}    void Push(const T& data)    {        _hp.Insert(data);    }    void Pop()    {        _hp.Remove();    }    const T& Top()const    {        return _hp.top();    }    size_t Size()const    {        return _hp.Size();    }    bool Empty()const    {        return _hp.Empty();    }    void Print()    {        _hp.Print();    }protected:    Heap<T, Less> _hp;};void test1(){    int arr[] = { 53, 17, 78, 9, 45, 65, 87, 23 };    Heap<int, Less> hp(arr, sizeof(arr) / sizeof(arr[0]));    hp.Insert(5);    hp.Print();    //  hp.Remove();    hp.Print();}void test2(){    int arr[] = { 53, 17, 78, 9, 45, 65, 87, 23 };    PriorityQueue<int> pq;//pq(arr, sizeof(arr) / sizeof(arr[0]));    pq.Push(53);    pq.Push(17);    pq.Push(78);    pq.Pop();    pq.Print();}int main(){    test1();    test2();    system("pause");}

阅读全文

0 0