大二上多媒體技術(shù)

C++進(jìn)行字母的HUFFMANHUFFMAN編碼，并統(tǒng)計(jì)平均碼長。1、讀入sumHUFFMAN2、對生成的HUFFMAN樹，求每個字符進(jìn)行HUFFMANHUFFMAN編碼，形成碼表，對應(yīng)碼表輸出字符串的HUFFMANS1S2連接到Hi的lchild和rchildHi節(jié)點(diǎn)的weightS1S2的weighti，i=1,2，…直到只剩下一個節(jié)點(diǎn)為止。至此，HUFFMAN樹構(gòu)造完成。1A—E的字符，統(tǒng)計(jì)出相應(yīng)的字符表和權(quán)值表如下，構(gòu)造子節(jié)點(diǎn)如下，構(gòu)（nHUFFMAN編碼，需要（2n-1）個節(jié)點(diǎn)）123456789ABCDE3524100000101010101078916694916694927030733580408050 6060206010 0101ABCDEchstrl[]wstrl[]。typedefunsignedintunsignedint #include<iostream>usingnamespacestd;typedefstruct{intweight; intparent,lchild,rchild;typedefchar**HuffmanCode;voidSelect(HuffmanTree&HT,intk,int&s1,int inti;while(i<=k&&{}{}{}}//treecodenvoidHuffmanCoding(HuffmanTree&HT,HuffmanCode&HC,int*w,intn){intm,c,f,s1,s2,i,start;char*cd; //n個葉子n-1 //0m+1元 {}{}{Select(HT,i-1,s1,s2);//選出當(dāng)前權(quán)值最小的} for(i=1;i<=n;i依次求{ {cd[--}

cd[--));//} }void int //ijcharj;charintb[26]={026charwhile((a=getchar())!= for {if(a==j||a==j+('a'-{] }}int for(i=0;i<26;++i){if(b[i]=={}{//printf("'%c':%d\n",i+'A',b[i]);//i+'A'b[i]的值打印頻率}}intp=0; intint*w; char*ch; HuffmanTreeHT;HuffmanCodeHC; //記錄權(quán)值，0號單元未用ch=(char*)malloc((nn+1)*sizeof(char));//記錄字符，0號單元未用cout<<"dataweight"<<endl;{} //cunchcunchHC【】for if(cun[p]==ch[i]||cun[p