//編碼 #include<iostream> #include<cstdio> #include<cstring> #include<cstdlib> #include<algorithm> #include<queue> #include<fstream> #include<map> using namespace std;typedef struct HuffmanNode{int w;//節(jié)點的權(quán)值 int ld, rd;//左右孩子節(jié)點 int p;//父節(jié)點 char ch;//當(dāng)前節(jié)點的字符HuffmanNode(){ld = rd = p = -1;} }huffmanNode, *pHuffmanNode;typedef pair<int, int> pii;//haffuman節(jié)點和它的編號 bool operator > (pii x, pii y){return x.first > y.first; }struct Huffman{int cntNode;//總結(jié)點的個數(shù) string orgCode;string huffmanCode;pHuffmanNode huffman = NULL;priority_queue<pii, vector<pii>, greater<pii> >qNode;map<string, char> huffmanMapx;//哈夫曼編碼對應(yīng)字符 map<char, string> huffmanMapy;//字符對應(yīng)哈夫曼編碼 void initHuffman(char *str){orgCode = str;cntNode = 0;int cnt[150];//統(tǒng)計每一個節(jié)點的個數(shù) memset(cnt, 0, sizeof(cnt));for(int i=0; str[i]; ++i){if(cnt[str[i]]==0) ++cntNode;++cnt[str[i]];}huffman = new HuffmanNode[2*(cntNode)];int index = 0;for(int i=0; i<150; ++i){if(cnt[i]!=0){huffman[index].w = cnt[i];huffman[index].ch = i;qNode.push(make_pair(huffman[index].w, index));++index;}}while(qNode.size()>=2) {pii ldPii = qNode.top();qNode.pop();pii rdPii = qNode.top();qNode.pop();huffman[index].w = ldPii.first + rdPii.first;huffman[index].ld = ldPii.second;huffman[index].rd = rdPii.second;huffman[ldPii.second].p = index;huffman[rdPii.second].p = index;qNode.push(make_pair(huffman[index].w, index));++index; }}void huffmanCoding() {for(int i=0; i<cntNode; ++i){//從每一個孩子節(jié)點向上尋找 string code = "";for(int child=i, p=huffman[child].p; ~p; child = p, p = huffman[child].p) {if(huffman[p].ld == child){//左子樹 code += '0';} else if(huffman[p].rd == child){//右子樹code += '1';} }reverse(code.begin(), code.end());huffmanMapx.insert(make_pair(code, huffman[i].ch));huffmanMapy.insert(make_pair(huffman[i].ch, code));}}void outHuffmanTree(fstream &fout, int f){if(huffman[f].ld==-1 && huffman[f].rd==-1){fout<<0<<" ";return ;} else {fout<<1<<" ";outHuffmanTree(fout, huffman[f].ld);outHuffmanTree(fout, huffman[f].rd);}}void outHuffmanCode(){huffmanCode = "";//存儲字符串的哈夫曼編碼之后的內(nèi)容 fstream fout("out.txt", ios_base::out);for(int i=0; i<orgCode.length(); ++i){huffmanCode += huffmanMapy[orgCode[i]];}cout<<huffmanCode<<endl;fout<<huffmanCode<<endl;//想文件中輸入huffman編碼int f = 2*cntNode-2;//huffman樹的父節(jié)點outHuffmanTree(fout, f);fout<<endl;for(map<string, char>::iterator it = huffmanMapx.begin(); it!=huffmanMapx.end(); ++it){cout<<it->first << " -> " << it->second<<endl; fout<<it->first<<" "<<it->second<<endl; //向文件中輸入HuffmanMap }} };int main(){char str[100];Huffman huffman;gets(str);huffman.initHuffman(str);huffman.huffmanCoding();huffman.outHuffmanCode();return 0; }

//譯碼 #include<iostream> #include<cstdio> #include<cstring> #include<cstdlib> #include<algorithm> #include<queue> #include<fstream> #include<map> using namespace std;typedef struct HuffmanTreeNode{HuffmanTreeNode *ld, *rd;HuffmanTreeNode(){ld = NULL;rd = NULL;} } *pHuffmanTreeNode;struct Huffman{pHuffmanTreeNode T;string code;map<string, char>huffmanMapx;void buildT(fstream &fin, pHuffmanTreeNode &T){int w;fin>>w;T = new HuffmanTreeNode(); if(w==0)return ;buildT(fin, T->ld);buildT(fin, T->rd);}void outT(pHuffmanTreeNode T){if(T->ld != NULL){cout<<0<<endl;outT(T->ld); }else return;if(T->rd != NULL){cout<<1<<endl;outT(T->rd); }}void initHuffmanTree(){fstream fin("in.txt", ios_base::in);T = NULL;fin>>code;buildT(fin, T);//outT(T);string mapContent;while(getline(fin, mapContent)){int index = mapContent.find_first_of(' ');huffmanMapx.insert(make_pair(mapContent.substr(0, index), mapContent[index+1]));}}void outHuffmanEncode(){string encode = "", cd="";initHuffmanTree();pHuffmanTreeNode p = T;for(int i=0; i<code.length(); ++i){if(p->ld==NULL && p->rd==NULL){encode+=huffmanMapx[cd];cd="";--i;p=T;} else {cd+=code[i];if(code[i]=='0')p=p->ld;else if(code[i]=='1')p=p->rd;}if(i==code.length()-1) encode+=huffmanMapx[cd];}cout<<encode<<endl;} };int main(){Huffman huffman;huffman.outHuffmanEncode();return 0; }

操作流程：

文本內(nèi)容：aaaaaaabbbbbccdddd, and I am a student, my name is hjzgg!

1.首先利用''編碼"工具將文本編碼，會輸出一個out.txt的文本，將out.txt文本中的內(nèi)容發(fā)送給你的好友。

2.接受到out.txt文本的內(nèi)容后，將內(nèi)容復(fù)制到文本名為in.txt的文件中，利用"譯碼"工具（保證in.txt和譯碼工具在同一目錄下）可以查看文本內(nèi)容。

3.其中out.txt文本的格式如下：

總結(jié)

以上是生活随笔為你收集整理的Huffman树进行编码和译码的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。