- 实验目的
- 掌握赫夫曼编码算法。
- 实验内容
基本要求:
算法:从终端读n个字符和n个权值,建立赫夫曼树;利用已建好的赫夫曼树,对输入的字符进行编码并输出编码结果。
选作内容:
在算法中,利用已建好的赫夫曼树对输入代码进行译码。
总结:这部分较为困难掌握思想才是主要的!
#include <stdio.h>
#include <string.h>
#include <malloc.h>
#include <stdlib.h>
#include <limits.h>
typedef struct HTNode{
unsigned int weight;
unsigned int parent,lchild,rchild;
}HTNode,*HuffmanTree;
typedef char **HuffmanCode;
int min(HuffmanTree T,int i){
int j,m;
unsigned int k=UINT_MAX;
for(j=1;j<=i;j++)
if(T[j].weight<k&&T[j].parent==0)
{
k=T[j].weight;
m=j;
}
T[m].parent=1;
return m;
}
void select(HuffmanTree T,int i,int &s1,int &s2){
int j;
s1=min(T,i);
s2=min(T,i);
if(s1>s2)
{
j=s1;s1=s2;s2=j;
}
}
void HuffmanCoding(HuffmanTree&HT,HuffmanCode &HC,int*w,int n)
{
int start; unsigned f;
int m,i,s1,s2;
unsigned c;
HuffmanTree p;
char *cd;
if(n<=1) ;m=2*n-1;
HT=(HuffmanTree)malloc((m+1)*sizeof(HTNode));
for(p=HT+1,i=1;i<=n;i++,p++,w++)
{
(*p).weight=*w;
(*p).parent=0;
(*p).lchild=0;
(*p).rchild=0;
}
for(;i<=m;i++,p++)
(*p).parent=0;
for(i=n+1;i<=m;i++)
{
select(HT,i-1,s1,s2);
HT[s1].parent=HT[s2].parent=i;
HT[i].lchild=s1;
HT[i].rchild=s2;
HT[i].weight=HT[s1].weight+HT[s2].weight;
}
HC=(HuffmanCode)malloc((n+1)*sizeof(char*));
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));
strcpy(HC[i],&cd[start]);
}
free(cd);
}
int main()
{
HuffmanTree HT;
HuffmanCode HC;
int *w,n,i;
printf("请输入权值的个数:");
scanf("%d",&n);
w=(int*)malloc(n*sizeof(int));
printf("\n请依次输入%d个权值",n);
for(i=0;i<=n-1;i++)
scanf("%d",w+i);
HuffmanCoding(HT,HC,w,n);
for(i=1;i<=n;i++)
puts(HC[i]);
return 0;
}
运行结果: