哈夫曼编码

#include<iostream>
#include<string>
using namespace std;

typedef struct
{
	unsigned int weight;           //权值
	unsigned int parent,lchild,rchild;   //父母和孩子指针        
}HTNode,*HuffmanTree;             //动态分配数组存储赫夫曼树

typedef char * *HuffmanCode;        //动态分配数组存储赫夫曼编码表

void select(HuffmanTree &HT,int n,int &s1,int &s2)
{
	int i,j;
	for(i=1;i<=n;i++)
	{
		if(!HT[i].parent)
		{
			s1=i;
			break;
		}
	}
	for(j=i+1;j<=n;j++)
	{
		if(!HT[j].parent)
		{
			s2=j;
			break;
		}
	}
	for(i=1;i<=n;i++)
	{
		if((HT[s1].weight>HT[i].weight)&&(!HT[i].parent)&&(s2!=i))
			s1=i;
	}
	for(j=1;j<=n;j++)
	{
		if((HT[s2].weight>HT[j].weight)&&(!HT[j].parent)&&(s1!=j))
			s2=j;
	}
}


//w存放n个字符的权值，构造哈弗曼树HT
//求出n个字符的哈夫曼编码HC
void HuffmanCoding(HuffmanTree &HT,HuffmanCode &HC,int *w,int n)
{
	if(n<=1) return;
	int m=2*n-1;          //有n个叶子节点，总结点数为2n-1
	HT=new HTNode[m+1];
	int i,j,k,l,c,f,s1,s2;

	for(i=1;i<=n;i++)
	{
		HT[i].weight=w[i-1];
		HT[i].parent=0;
		HT[i].lchild=0;
		HT[i].rchild=0;
	}

	for( j=n+1;j<=m;j++)
	{
		HT[j].weight=0;
		HT[j].parent=0;
		HT[j].lchild=0;
		HT[j].rchild=0;
	}
	//建立哈弗曼树，
	//在HT[1...i-1]选择parent为0的且weight最小的两个节点，其序号分别为s1，s2;
	for(i=n+1;i<=m;i++)
	{
		select(HT,i-1,s1,s2);
		HT[s1].parent=i;
		HT[s2].parent=i;
		HT[i].lchild=s1;
		HT[i].rchild=s2;
		HT[i].weight=HT[s1].weight+HT[s2].weight;
	}

	//从叶子节点到根逆向求每个字符的哈夫曼编码
	HC=new char*[n+1];   //分配n个字符的编码的头指针向量
	char* cd;
	cd=new char[n];            //分配求编码的工作空间
	cd[n-1]='\0';            //编码结束符
	for(l=1;l<=n;l++)
	{//逐个字符求哈弗曼编码
		int start=n-1;//编码结束符的位置
		for(c=l,f=HT[l].parent;f!=0;c=f,f=HT[f].parent)
		{//从叶子到根逆向求编码
			if(HT[f].lchild==c)
				cd[--start]='0';
			else
				cd[--start]='1';
		}
			HC[l]=new char[n-start];//为第i个字符分配空间
			strcpy(HC[l],&cd[start]);//从cd复制编码到HC
	}
	delete cd;   //释放工作空间
	//delete HT;
	//delete HC;
}
		

void main()
{
	HuffmanTree HT;
	HuffmanCode HC;
	int *w,n,i;
	cout<<"输入结点数:";
	cin>>n;
	HC=new char*[n];
	w=new int[n];
	cout<<"输入"<<n<<"个结点的权值"<<endl;
	for(i=0;i<n;i++)
		cin>>w[i];
	HuffmanCoding(HT,HC,w,n);
	cout<<"请输入各节点的赫夫曼编码:"<<endl;
	for(i=1;i<=n;i++)
		cout<<i<<"( "<<w[i-1]<<" )"<<" :"<<HC[i]<<endl;
	delete HC;
	delete w;
}