用优先级队列实现霍夫曼编码,采用贪心算法,每次从优先级队列中选取两个最小元素进行合并。
注意用优先级队列时用的是小顶堆,采用仿函数做比较器,不能用函数指针来实现。
代码如下:
#include<iostream>
#include<queue>
using namespace std;
struct Node
{
char c;
int val;
Node *lChild;
Node *rChild;
Node(char cc,int v):c(cc),val(v){}
friend bool operator < (Node n,Node m)
{
return n.val<m.val;
}
};
struct compare
{
bool operator()(Node *first,Node *second)
{
return first->val>second->val;
}
};
bool comp(int first,int second)//优先级队列中不能用函数指针,只能用函数对象或者重载<
{
return first>second;
}
Node *buildHuffman(char *A,int *V,int N)
{
priority_queue<Node*,vector<Node *>,compare> q;
for(int i=0;i<N;i++)
{
Node *curr=new Node(A[i],V[i]);
q.push(curr);
}
for(int i=1;i<N;i++)
{
Node *x=q.top();
q.pop();
Node *y=q.top();
q.pop();
Node *curr=new Node(0,x->val+y->val);
curr->lChild=x;
curr->rChild=y;
q.push(curr);
}
Node *root=q.top();
q.pop();
return root;
}
int main()
{
char A[]="abcdef";
int V[]={45,13,12,16,9,5};
Node *root=buildHuffman(A,V,6);
system("pause");
return 0;
}