哈夫曼编码及译码.doc

哈夫曼编码及译码#include#include#include#includeusing namespace std;struct HuffmanNodeint parent;int weight;int lchild,rchild;class HuffmanTreepublic:void CountHuffman();void CodeHuffman();void DecodeHuffman();huffmanTree();private:struct HuffmanNode *Node;char *data;int leaf;int vv;char a100;int q100100;HuffmanTree:huffmanTree()Node=NULL;data=NULL;leaf=NULL;vv=NULL;void HuffmanTree:CountHuffman() /输入字符并统计字符数目int count100;for(int j=1;j=26;j+)countj=0;int c;char x;couta;c=strlen(a);for(int i=0;ic;i+)x=(*(a+i);for(int zz=1;zz=26;zz+)if(x=a+zz-1|x=A+zz-1)countzz+;int k=0;for(i=1;i=26;i+)if(counti!=0)k+;leaf=k;int pos1,pos2,min1=1000,min2=1000;Node=new HuffmanNode2*leaf-1; data=new charleaf;int f=0;int g=0;for(i=1;i=26;i+)if(counti!=0)dataf=a+i-1;Nodef.weight=counti; g=g+counti;Nodef.parent=-1; Nodef.lchild=-1; Nodef.rchild=-1;f+;for(i=leaf;i2*leaf-1;i+)for(j=0;ji;j+)if(Nodej.parent=-1&Nodej.weight=min1)min1=Nodej.weight;pos1=j;Nodepos1.parent=i;Nodei.lchild=pos1;for(j=0;ji;j+)if(Nodej.parent=-1&Nodej.weightmin2)min2=Nodej.weight;pos2=j;Nodepos2.parent=i;Nodei.rchild=pos2;Nodei.parent=-1;Nodei.weight=Nodepos1.weight+Nodepos2.weight;min1=1000;min2=1000;if(Nodei.weight=g)vv=i;cout字母及字母数量统计：endl;for(i=0;ileaf;i+)coutNodei.weight;if(ileaf)coutdatai;cout ;coutendl;void HuffmanTree:CodeHuffman() /编码int A100100;int d=0,ac=0,b,s,v,k=0,c;char x;cout字母所对应的编码：endl;for(int i=0;i0)ac-;if(Nodev.lchild=Aiac)v=Aiac;Aiac=0;else if(Nodev.rchild=Aiac)v=Aiac;Aiac=1;coutdatai=0;j-)coutAij;qid=Aij;d+;qid=9;ac=0;d=0;coutendl;c=strlen(a);couta;cout编码为：endl;for(i=0;ic;i+)x=(*(a+i);for(int j=0;jleaf;j+)if(x=dataj)while(qjk9)coutqjk;k+;k=0;coutendl;void HuffmanTree:DecodeHuffman() /译码int p100;int c,t=0,j=0;char x;char b100;coutb;c=strlen(b);cout译码为：;for(int i=0;ic;i+)x=(*(b+i);if(x=0)pt=0;t+;if(x=1)pt=1;t+;for(int k=0;kleaf;k+)while(qkj!=9)j+;if(t=j)int y=0;while(py=qky&y=j)y+;if(y=j)coutdatak;t=0;j=0;coutendl;void main()HuffmanTree t;while(1)cout哈夫曼编码及译码小程序：endl;cout请选择：endl;cout1、输入字符串并统计字符的种