2020年编辑Huffman编码器总结编辑

1、#include<iostream>#include"string.h" using namespace std;#define MAX 100#define N 26typedef struct/ 哈夫曼树的结点unsigned int weight;unsigned int parent,lchild,rchild;HTNode,*Huffmantree;typedef struct/ 字符存储结点信息char data; /待编码的字符int weight; /字符的权值char codeN; /字符的编码 HTCode;/ 初始化结点信息void Ini

2、tCode(HTCode *Hr,int &n)cout<<" 请输入字符编码的个数 n： " cin>>n;cout<<" 请输入待编码字符以及相应的权值： "<<endl;for(int i = 1;i <= n;i+)cin>>(Hr+i)->data>>(Hr+i)->weight;void Select(Huffmantree &HT,int end,int *s1,int *s2)/ 在 0end 之间 ,找出最小和次小的两个结点序号 ,

3、返回 S1,S2int i;int min1 = MAX;int min2;for (i = 1;i <= end;i+)/ 找最小的结点序号if (HT+i)->parent = 0 && (HT+i)->weight<=min1)*s1 = i;min1 = (HT+i)->weight;min2 = MAX;for(i = 1;i <= end;i+)/ 找次小结点的序号if (HT+i)->parent = 0 && *s1 != i && min2 >= (HT+i)->weight

4、)*s2 = i;min2 = (HT+i)->weight;/ 初始化哈夫曼树 , 并把信息存入 Hrvoid InitHfmtree(Huffmantree &Ht,HTCode Hr,int &n)if(n <= 1) return;int m,start,i,j,f;int s1,s2;m = 2*n-1; /n 个顶点有 m 个节点Ht = (Huffmantree)malloc(m+1)*sizeof(HTNode);Huffmantree P;P = Ht+1;for(i = 1;i <= m;i+,P+) /0 号单元没用if(i <=

5、n) P->weight = Hri.weight;else P->weight = 0;P->lchild = 0;P->rchild = 0;P->parent = 0;for(i = n+1;i <= m;i+) / 建赫夫曼树Select(Ht,i-1,&s1,&s2);/ 寻找匹配双亲节点(Ht+s1)->parent = i;(Ht+s2)->parent = i;(Ht+i)->lchild = s1;(Ht+i)->rchild = s2;(Ht+i)->weight = (Ht+s1)->

6、weight + (Ht+s2)->weight;char *code;code = (char *)malloc( n*sizeof(char);coden-1 = '0'for(i = 1;i <= n;i+)/ 编码存入 Hr->codestart = n-1;for(j = i,f = Htj.parent;f != 0;j = f,f = Htf.parent)if(Htf.lchild = j)code-start = '0'elsecode-start = '1'strcpy(Hri.code,&codes

7、tart);cout<<" 字符编码初始化完成！ "<<endl;void Encoding(HTCode *Hr,int n)/ 编码int i,j;char *encode;encode = (char *)malloc( n*sizeof(char);cout<<" 请选择你想要编码的字符： "<<endl;cin>>encode;for(i = 0;encodei!='0'i+)j = 1;while(encodei != Hrj.data) j+;if(j>n)&

8、quot;<<endl;cout<<" 您输入编码 "<<encodei<<" 错误！elsecout<<Hrj.data<<" 的编码是 "<<Hrj.code<<endl;/cout<<" 编码已经结束！ "<<endl;/cout<<Hrj.data<<" 的编码是 "<<Hrj.code<<endl;cout<<&quo

9、t; 编码已经结束！ "<<endl;void Decoding(HTCode *Hr,int n)/ 译码int j=1;char *decode;decode = (char *)malloc( n*sizeof(char);cout<<" 请输入你想要译码的字符串： "<<endl;cin>>decode;for(j=1;j<=n;j+)if(strcmp(decode,Hrj.code) != 0);else break;if(j>n)cout<<" 您输入译码的字符串错误！

10、 "<<endl;elsecout<<Hrj.code<<" 的译码是 "<<Hrj.data<<endl;cout<<" 译码已经结束！ "<<endl;void TreePrint(Huffmantree &HT,HTCode Hr,int n)/ 打印各个结点信息int i,j;cout<<"nn*打印哈夫曼树*n"<<endl;cout<<" 结点 weight parent lc

11、hild rchild"<<endl;for (j=1; j<=n; j+) printf("n%4d(%c)%5d%8d%8d%8dn",j,Hrj.data,HTj.weight,HTj.parent,HTj.lc hild,HTj.rchild);for (i=n+1; i <= 2*n-1; i+) printf("n%4d%8d%8d%8d%8dn",i,HTi.weight,HTi.parent,HTj.lchild,HTi.rchi ld);void main()Huffmantree Ht;HTCode

12、HrN;cout<<"t* 欢迎使用赫夫曼编译码 *"<<endl;int n = 0;char cmd;do印赫夫曼树cout<<"* 初始化赫夫曼树( I ) 编码( E) 译码( T) 离开( Q) *"<<endl;cin>>cmd;switch(cmd)case 'I':InitCode(Hr,n);InitHfmtree(Ht,Hr,n);break;case 'E':Encoding(Hr,n);break;case 'D':Decoding(Hr,n);bre