哈弗曼編碼C程序

1、#include #include #include #include using namespace std;int ii=0;char a1200;int n1=0;int nn200;int mm200;int n,nn1; /輸入字符串的長(zhǎng)度class Huffmanpublic:char elementChar;/節(jié)點(diǎn)元素int weight;/權(quán)重char s;/哈夫曼編碼Huffman* parent;/父節(jié)點(diǎn)Huffman* leftChild;/左孩子Huffman* rightChild;/右孩子void Display(; /顯示壓縮效果Huffman(;Huffman(

2、char a, int weight;bool operator < (const Huffman &mconst return weight < m.weight;hh;Huffman:Huffman(parent = leftChild = rightChild = NULL;void Huffman:Display(cout< double c;int num=0;for(int i=0;i<200;i+num=num+nni*mmi;c=100*(8*n-num/(8*n;cout<<"編碼前字符串的長(zhǎng)度是"<<

3、;8*n< cout<<"編碼后字符串的長(zhǎng)度是"< cout<<"壓縮比為"< int huffmanCode(Huffman & h /遞歸輸出哈夫曼值if(h.leftChild = NULL && h.rightChild = NULL/如果是葉子節(jié)點(diǎn)，輸出器哈夫曼編碼string ss;Huffman temp = h;while(temp.parent != NULLnnn1=nnn1+1;ss = temp.s+ss;temp = *temp.parent;mmn1=h.wei

4、ght;n1+;cout << h.elementChar << "的哈夫曼編碼是：" << ss << endl;return 0;/左孩子huffmanCode(*h.leftChild;/右孩子 huffmanCode(*h.rightChild;void Decode(Huffman & h /解碼Huffman temp = h;int i;for(i=0;i if(temp.leftChild!= NULLif(a1i='0'temp= *temp.leftChild;else if(a1i

5、='1'temp = *temp.rightChild;elsecout< temp=hh;i-;void main(cout << "請(qǐng)輸入需要編碼的字符串：" << endl;char a200;for(int z=0;z<200;z+az=NULL;cin.getline(a,200;cout< int xx=0;for(int yy=0;yy<200;yy+if(ayy!=NULLxx+;string huffmanStr;char y;for(int x=0;x y=ax;huffmanStr=huf

6、fmanStr+y;n=huffmanStr.length(;Huffman huffmanTemp;vector < Huffman > huffmanQueue;/得到字符串信息char cha100; /數(shù)組cha記錄所有輸入字符的種類int i=0,j,m100,h,k=0; /數(shù)組m記錄各種輸入字符的頻度，和cha對(duì)應(yīng)for(i=0; i < n; i+j = 0; h = 0;while(huffmanStri != huffmanStrjj+;if(j = ichak = huffmanStri;cout << "字符" <

7、< chak << "出現(xiàn)"else /如果j !=i 則略過(guò)此次循環(huán)continue;for(j = i; j < n; j+if(huffmanStri = huffmanStrjh+;cout << h << "次" << endl;mk = h;k+;/初始化隊(duì)列for(i = 0; i < k; i+huffmanTemp.elementChar = chai;huffmanTemp.weight = mi;huffmanQueue.push_back(huffmanTemp;

8、/得到哈夫曼樹(shù)所有結(jié)點(diǎn)int huffmanQueue_index = 0;sort(huffmanQueue.begin(, huffmanQueue.end(;while(huffmanQueue.size( < 2 * k - 1/合成最小兩個(gè)節(jié)點(diǎn)的父結(jié)點(diǎn)huffmanTemp.weight = huffmanQueuehuffmanQueue_index.weight + huffmanQueuehuffmanQueue_index + 1.weight;huffmanQueuehuffmanQueue_index.s = '0'huffmanQueuehuffm

9、anQueue_index + 1.s = '1'huffmanTemp.elementChar = '*' /新生成的父結(jié)點(diǎn)的標(biāo)志huffmanQueue.push_back(huffmanTemp;/將父結(jié)點(diǎn)加入隊(duì)列sort(huffmanQueue.begin(, huffmanQueue.end(;huffmanQueue_index += 2;/構(gòu)造哈夫曼樹(shù)int step = 0;while(step < 2 * k-2for(int j = step + 1; j <= huffmanQueue.size(; j+if(huffmanQ

10、ueuej.elementChar = '*' && huffmanQueuej.leftChild = NULL && (huffmanQueuej.weight = huffmanQueuestep.weight + huffmanQueuestep+1.weighthuffmanQueuej.leftChild = &huffmanQueuestep;huffmanQueuej.rightChild = &huffmanQueuestep+1;huffmanQueuestep.parent = huffmanQueuestep+1.parent = &huffmanQueuej;break;step += 2;huffmanTemp = huffmanQueue.back(; /哈弗曼樹(shù)的根hh=huffmanTemp;cout< huffmanCode(huffmanTemp;/huffmanTemp.Display(;cout< for(z=0;z<200;z+a1z=NULL;cout << "請(qǐng)輸入需要解碼的字符串：" << endl;bool judge=true;cin.