2020年編輯Huffman編碼器總結(jié)編輯

1、#include<iostream>#include"string.h" using namespace std;#define MAX 100#define N 26typedef struct/ 哈夫曼樹的結(jié)點(diǎn)unsigned int weight;unsigned int parent,lchild,rchild;HTNode,*Huffmantree;typedef struct/ 字符存儲(chǔ)結(jié)點(diǎn)信息char data; /待編碼的字符int weight; /字符的權(quán)值char codeN; /字符的編碼 HTCode;/ 初始化結(jié)點(diǎn)信息void Ini

2、tCode(HTCode *Hr,int &n)cout<<" 請(qǐng)輸入字符編碼的個(gè)數(shù) n： " cin>>n;cout<<" 請(qǐng)輸入待編碼字符以及相應(yīng)的權(quán)值： "<<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 之間 ,找出最小和次小的兩個(gè)結(jié)點(diǎn)序號(hào) ,

3、返回 S1,S2int i;int min1 = MAX;int min2;for (i = 1;i <= end;i+)/ 找最小的結(jié)點(diǎn)序號(hào)if (HT+i)->parent = 0 && (HT+i)->weight<=min1)*s1 = i;min1 = (HT+i)->weight;min2 = MAX;for(i = 1;i <= end;i+)/ 找次小結(jié)點(diǎn)的序號(hào)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 個(gè)頂點(diǎn)有 m 個(gè)節(jié)點(diǎn)Ht = (Huffmantree)malloc(m+1)*sizeof(HTNode);Huffmantree P;P = Ht+1;for(i = 1;i <= m;i+,P+) /0 號(hào)單元沒用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);/ 尋找匹配雙親節(jié)點(diǎn)(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<<" 請(qǐng)選擇你想要編碼的字符： "<<endl;cin>>encode;for(i = 0;encodei!='0'i+)j = 1;while(encodei != Hrj.data) j+;if(j>n)&

8、quot;<<endl;cout<<" 您輸入編碼 "<<encodei<<" 錯(cuò)誤！elsecout<<Hrj.data<<" 的編碼是 "<<Hrj.code<<endl;/cout<<" 編碼已經(jīng)結(jié)束！ "<<endl;/cout<<Hrj.data<<" 的編碼是 "<<Hrj.code<<endl;cout<<&quo

9、t; 編碼已經(jīng)結(jié)束！ "<<endl;void Decoding(HTCode *Hr,int n)/ 譯碼int j=1;char *decode;decode = (char *)malloc( n*sizeof(char);cout<<" 請(qǐng)輸入你想要譯碼的字符串： "<<endl;cin>>decode;for(j=1;j<=n;j+)if(strcmp(decode,Hrj.code) != 0);else break;if(j>n)cout<<" 您輸入譯碼的字符串錯(cuò)誤！

10、 "<<endl;elsecout<<Hrj.code<<" 的譯碼是 "<<Hrj.data<<endl;cout<<" 譯碼已經(jīng)結(jié)束！ "<<endl;void TreePrint(Huffmantree &HT,HTCode Hr,int n)/ 打印各個(gè)結(jié)點(diǎn)信息int i,j;cout<<"nn*打印哈夫曼樹*n"<<endl;cout<<" 結(jié)點(diǎn) 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