P176 例8-4 设有字符集{A，B，C，D}，各字符在电文中的次数集为{1，3，5，7}，设计各字符的哈夫曼编码。

P176 例8-4 设有字符集{A，B，C，D}，各字符在电文中的次数集为{1，3，5，7}，设计各字符的哈夫曼编码。

头文件：Haffman.h

#include<stdio.h>
#include<stdlib.h> 

#define MaxValue 10000
#define MaxBit 4 

typedef struct
{
	int weight;
	int flag;
	int parent;
	int leftChild;
	int rightChild;
}HaffNode;
 
typedef struct
{
	int bit[MaxBit];
	int start;
	int weight;	
}Code;

void Haffman(int weight[],int n,HaffNode haffTree[])
{
	int i,j,m1,m2,x1,x2;
	for(i=0;i<2*n-1;i++)
	{
		if(i<n)
			haffTree[i].weight=weight[i];
		else
			haffTree[i].weight=0;
		haffTree[i].parent=-1;
		haffTree[i].flag=0;
		haffTree[i].leftChild=-1;
		haffTree[i].rightChild=-1;
	}
	
    for(i=0;i<n-1;i++)
    {
	    m1=m2=MaxValue;
	    x1=x2=0;
	    for(j=0;j<n+i;j++)
	    {
		    if(haffTree[j].weight<m1&&haffTree[j].flag==0)
		    {
			    m2=m1;
				x2=x1;
			    m1=haffTree[j].weight;
			    x1=j;
		    }
		    else if(haffTree[j].weight<m2&&haffTree[j].flag==0)
		    {
			    m2=haffTree[j].weight;
			    x2=j;
		    }
	    }
    	haffTree[x1].parent=n+i;
    	haffTree[x2].parent=n+i;
    	haffTree[x1].flag=1;
    	haffTree[x2].flag=1;
    	haffTree[n+i].weight=haffTree[x1].weight+haffTree[x2].weight;
    	haffTree[n+i].leftChild=x1;
    	haffTree[n+i].rightChild=x2;
    }
}

void HaffmanCode(HaffNode haffTree[],int n,Code haffCode[])
{
    Code *cd=(Code *)malloc(sizeof(Code));
    int i,j,child,parent;
    
    for(i=0;i<n;i++)
    {
	    cd->start=n-1;
	    cd->weight=haffTree[i].weight;
	    child=i;
	    parent=haffTree[child].parent;
	    
        while(parent!=-1)
        {
	        if(haffTree[parent].leftChild==child)
	        	cd->bit[cd->start]=0;
	        else
	        	cd->bit[cd->start]=1;
	        cd->start--;
	        child=parent;
	        parent=haffTree[child].parent; 
        } 
        
        for(j=cd->start+1;j<n;j++)
        	haffCode[i].bit[j]=cd->bit[j];
        haffCode[i].start=cd->start+1;
        haffCode[i].weight=cd->weight;
    }
}

源文件：例8-4.c

#include"Haffman.h"

int main()
{
	int i,j,n=4;
	int weight[]={1,3,5,7};
	
	HaffNode *myHaffTree=(HaffNode *)malloc(sizeof(HaffNode)*(2*n+1));
	Code *myHaffCode=(Code *)malloc(sizeof(Code)*n);
	
	if(n>MaxBit)
	{
		printf("给出的n越界，修改MaxBit!\n");
		exit(0);
	}
	Haffman(weight,n,myHaffTree);
	HaffmanCode(myHaffTree,n,myHaffCode);
	
	for(i=0;i<n;i++)
	{
		printf("Weight=%d Code=",myHaffCode[i].weight);
		for(j=myHaffCode[i].start;j<n;j++)
		printf("%d",myHaffCode[i].bit[j]);
		printf("\n");
    }
    return 0;
}