hhh.zip_HHH1_sound62q_哈夫曼树

#include<stdio.h> #define MAXVALUE 10000 typedef struct node{ char data; int weight; int parent; int lchild; int rchild; }HNodeType; typedef struct { char data; int bit[100]; int start; }HCodeType; typedef struct { char w; int num; }qt; void HuffmanTree(HNodeType HuffNode[],int n,qt a[]) { int i,j,m1,m2,x1,x2; int temp1; char temp2; for(i=0;i<2*n-1;i++) { HuffNode[i].data=NULL; HuffNode[i].weight=0; HuffNode[i].parent=-1; HuffNode[i].lchild=-1; HuffNode[i].rchild=-1; } for(i=0;i<n-1;i++) for(j=i+1;j<n-1;j++) if(a[j].num>a[i].num) { temp1=a[i].num;a[i].num=a[j].num;a[j].num=temp1; temp2=a[i].w;a[i].w=a[j].w;a[j].w=temp2;} for(i=0;i<n;i++) { HuffNode[i].weight=a[i].num; HuffNode[i].data=a[i].w;} for(i=0;i<n-1;i++) { m1=m2=MAXVALUE; x1=x2=0; for(j=0;j<n+i;j++) { if(HuffNode[j].parent==-1&&HuffNode[j].weight<m1) { m2=m1;x2=x1; m1=HuffNode[j].weight; x1=j; } else if(HuffNode[j].parent==-1&&HuffNode[j].weight<m2) { m2=HuffNode[j].weight; x2=j; } } HuffNode[x1].parent=n+i;HuffNode[x2].parent=n+i; HuffNode[n+i].weight=HuffNode[x1].weight+HuffNode[x2].weight; HuffNode[n+i].lchild=x1; HuffNode[n+i].rchild=x2; } } void HuffmanCode(int n,qt a[]) { HNodeType HuffNode[1000]; HCodeType HuffCode[1000],cd; int i,j,c,p; char code[30],*m; HuffmanTree(HuffNode,n,a); for(i=0;i<n;i++) { cd.start=n-1; c=i; p=HuffNode[c].parent; while(p!=-1) { if(HuffNode[p].lchild==c) cd.bit[cd.start]=0; else cd.bit[cd.start]=1; cd.start--; c=p; p=HuffNode[c].parent;} for(j=cd.start+1;j<n;j++) HuffCode[i].bit[j]=cd.bit[j]; HuffCode[i].start=cd.start; } printf("输出每个叶子的哈夫曼编码：\n"); for(i=0;i<n;i++) { HuffCode[i].data=HuffNode[i].data; printf(" %c:",HuffCode[i].data); for(j=HuffCode[i].start+1;j<n;j++) printf(" %d",HuffCode[i].bit[j]); printf("\n"); } printf("请输入:\n"); for(i=0;i<30;i++) code[i]=NULL; scanf(" %s",&code); m=code; c=2*n-2; printf("输出哈夫曼译码:\n"); while(*m!=NULL) { if(*m=='0') { c=i=HuffNode[c].lchild; if(HuffNode[c].lchild==-1&&HuffNode[c].rchild==-1) { printf("%c",HuffNode[i].data); c=2*n-2; } } if(*m=='1') { c=i=HuffNode[c].rchild; if(HuffNode[c].lchild==-1&&HuffNode[c].rchild==-1) { printf("%c",HuffNode[i].data); c=2*n-2; } } m++; } printf("\n"); } int main() { qt data[30]; char s[100],*p; int i,count=0; printf("\n 请输入字符串:"); scanf("%s",&s); for(i=0;i<30;i++) { data[i].w=NULL; data[i].num=0;} p=s; while(*p) { for(i=0;i<=count+1;i++) { if(data[i].w==NULL) { data[i].w=*p;data[i].num++;count++;break; } else if(data[i].w==*p) { data[i].num++;break; } } p++; } printf("\n"); HuffmanCode(count,data); return 0; }