淮南市陈永涛:赫夫曼编码
来源:百度文库 编辑:偶看新闻 时间:2024/04/29 16:41:45
#include
#include
#include
#define N 10 /*待编码字符的个数,即树中叶结点的最大个数*/#define M 2*N-1 /*树中总的结点数目*/typedef struct{ unsigned int weight; unsigned int parent,lchild,rchild; }HTNode; /*树中结点的结构*/typedef struct { char data; /*待编码的字符*/ int weight; /*字符的权值 */ char code[N]; /*字符的编码 */} HTCode;void Init(HTCode hc[],int *n){ /*初始化,读入待编码字符的个数n,从键盘输入n个字符和n个权值*/int i; printf("\n输入待编码字符的个数n:n="); scanf("%d",&(*n)); printf("\n依次输入 %d个字符\n",*n); for (i=1;i<=*n;i++)
{ hc[i].data=getch();
printf("%c",hc[i].data);} printf("\n依次输入 %d 个字符的权值,以空格隔开\n",*n); for (i=1;i<=*n;i++) scanf("%d",&(hc[i].weight));}
void Select(HTNode ht[],int k,int *s1,int *s2){/*ht[1…k]中选择parent为0,并且weight最小的两个结点 其序号由指针变量s1,s2指向*/ int i; for (i=1;i<=k && ht[i].parent!=0 ;i++); *s1=i; for (i=1;i<=k;i++) if (ht[i].parent==0 && ht[i].weight
#include
#include
#define N 10 /*待编码字符的个数,即树中叶结点的最大个数*/#define M 2*N-1 /*树中总的结点数目*/typedef struct{ unsigned int weight; unsigned int parent,lchild,rchild; }HTNode; /*树中结点的结构*/typedef struct { char data; /*待编码的字符*/ int weight; /*字符的权值 */ char code[N]; /*字符的编码 */} HTCode;void Init(HTCode hc[],int *n){ /*初始化,读入待编码字符的个数n,从键盘输入n个字符和n个权值*/int i; printf("\n输入待编码字符的个数n:n="); scanf("%d",&(*n)); printf("\n依次输入 %d个字符\n",*n); for (i=1;i<=*n;i++)
{ hc[i].data=getch();
printf("%c",hc[i].data);} printf("\n依次输入 %d 个字符的权值,以空格隔开\n",*n); for (i=1;i<=*n;i++) scanf("%d",&(hc[i].weight));}
void Select(HTNode ht[],int k,int *s1,int *s2){/*ht[1…k]中选择parent为0,并且weight最小的两个结点 其序号由指针变量s1,s2指向*/ int i; for (i=1;i<=k && ht[i].parent!=0 ;i++); *s1=i; for (i=1;i<=k;i++) if (ht[i].parent==0 && ht[i].weight