总体思路:先构建一棵最小生成树,然后左孩子给它标上‘0’,右孩子标上‘1’,然后从叶子节点追溯到根,存储到数组cd【】中。
构建最小生成树的方法:从权重中选择两个最小的,构成一棵树,并将新生成的权重加入之前的权重中HT【i】.weight中,直到构成一棵完整的二叉树。
话不多说,直接上代码。
#include "stdio.h"
#include "stdlib.h"
#include "string.h"
typedef struct
{
unsigned int weight;
unsigned int parent,lchild,rchild;
}HTNode,*HuffmanTree;//动态分配数组存储哈夫曼树
typedef char ** HuffmanCode;//动态分配数组存储哈夫曼编码
//不能出现TH[1]->parent的结构
void Select(HuffmanTree HT,int j,int *s1,int *s2)//j为结点的个数,s1为最小值的下标,s2为次小值的下标
{
int cmin = 100,min = 100;
int k = 1;
while(k <= j)
{
if((HT[k]).parent == 0)
{
if(HT[k].weight < min)
{
min = HT[k].weight;
*s1 = k;
}
else if(HT[k].weight >= min&&HT[k].weight <= cmin)
{
cmin = HT[k].weight;
*s2 = k;
}
}
k++;
}
HT[*s1].parent = 0;
HT[*s2].parent = 0;
}
//w用来存放n个字符的权值(w > 0),构造哈夫曼树HT,并求出n个字符的哈夫曼编码HC
void HuffmanCoding(HuffmanTree HT,HuffmanCode *HC,int *w,int n)//HC使用三重指针的原因,将HC的值带出去
{
HuffmanTree p;
int s1,s2,m,i;//s1为最小数的下标,s2为次小数的下标
int start,c,f;//start字符最开始的下标,c为
char *cd;//用来存储哈夫曼编码
if(n <= 1)
return;
m = 2 * n - 1;
HT = (HuffmanTree)malloc((m + 1) * sizeof(HTNode));
for(p = HT,i = 1;i <= n;i++,w++)//给前n个结点赋初值,从1开始
{
p[i].weight = *w;
p[i].lchild = 0;
p[i].rchild = 0;
p[i].parent = 0;
}
//建一棵哈夫曼树
for(i = n + 1;i <= m;i++)
{
Select(HT,i - 1,&s1,&s2);//挑选出最小和次小元素,并用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;
HT[i].parent = 0;
}
//求哈夫曼编码
(*HC) = (HuffmanCode)malloc((n + 1) * sizeof(char *));//分配n个字符编码的头指针向量
cd = (char *)malloc(n * sizeof(char));//分配求编码的工作空间
cd[n - 1] = '\0';
for(i = 1;i <= n;i++)
{
start = n - 1;//编码结束的位置
for(c = i,f = HT[i].parent;f != 0;c = f,f = HT[f].parent) //从叶子到根逆向求编码
{
if(HT[f].lchild == c)
cd[--start] = '0';
else
cd[--start] = '1';
}
(*HC)[i] = (char*)malloc((n-start) * sizeof(char));//为第i个字符编码分配空间
strcpy((*HC)[i],&cd[start]);//此处不能传cd,因为下标不一定从0开始
}
free(cd);
}
int main()
{
int w[] = {15,25,45,5,10};
int n,i;
HuffmanTree HT = NULL;
HuffmanCode HC = NULL;
n = sizeof(w)/sizeof(int);
HuffmanCoding(HT,&HC,w,n);
for(i = 1;i <= n;i++)
{
printf("%d的哈夫曼编码为:",w[i - 1]);
printf("%s\n",HC[i]);
}
return 0;
}