哈夫曼编码和译码（老师给的样题样解）

标题： 作业六----哈夫曼编码和译码
内容： [问题描述]

有两个城市要进行通讯，已知他们通讯内容为字符集C且字符集中的每一个字符c的频率是f(c).现在要你给通讯内容编码使通讯信息量最少，并输出字符集C中每个字符的编码长度。

[输入要求]

有多组测试数据，每组数据的第一行是字符集C中的字符个数n(0n=1000),接下来的n行每行含有字符c和字符的频率f(c)(0f(c)=1000)。

[输出要求]

对每组数据，按输入给定的字符集的顺序每行输出一个字符c和它的编码长度，中间用一个空格隔开。

[样例输入]

4

A 10

B 20

C 2

D 5

 

[样例输出]

A 2

B 1

C 3

D 3

样解1

#include<iostream> #include<string.h> using namespace std; typedef struct TreeNode { char c; int w; int parent; int right; int left; int tag; char * code; }Node; void Find(Node * tree, int n, int & m1, int & m2) { m1 = -1; while(tree[++ m1].tag != 0); m2 = m1; while(tree[++ m2].tag != 0); for(int i = m2 + 1; i < n; i ++) { if(tree[i].tag == 0) { if(tree[i].w < tree[m1].w || tree[i].w < tree[m2].w) { if(tree[m2].w < tree[m1].w) m1 = m2; m2 = i; } } } } void Huffman(Node * tree, int n) { int min1, min2; for(int i = 0; i < n - 1; i ++) { Find(tree, n + i, min1, min2); tree[n + i].w = tree[min1].w + tree[min2].w; tree[n + i].left = min1; tree[n + i].right = min2; tree[n + i].tag = 0; tree[n + i].parent = 0; tree[min1].parent = n + i; tree[min2].parent = n + i; tree[min1].tag = 1; tree[min2].tag = 1; } } void HuffmanCoding(Node * tree, int n) { char * code = new char[n]; char * t = code + n - 1; for(int i = 0; i < n; i ++) { int k = i; code = t; *code= '/0'; while(tree[k].parent != 0) { int p = tree[k].parent; if(tree[p].left == k) *(-- code) = '0'; else *(-- code) = '1'; k = p; } tree[i].code = new char[strlen(code) + 1]; strcpy(tree[i].code, code); cout<<tree[i].c<<" "<<tree[i].code<<endl; } //译码 { cout<<"input string:"<<endl; char c; bool find = false; while((c = getchar()) != '/n') { for(int i = 0; i < n; i ++) { if(tree[i].c == c) { cout<<tree[i].code; find = true; break; } } if(find) { find = false; } else { cout<<"*"; break; } } cout<<endl; } } void HffmanDecoding(Node * tree, int n) { cout<<"input code:"<<endl; char c; int i = 2 * n - 2; while((c = getchar()) != '/n') { if(c == '0') { i = tree[i].left; } else if(c == '1') { i = tree[i].right; } else { cout<<"*"<<endl; break; } if(i < n) { cout<<tree[i].c; i = 2 * n - 2; } } } int main() { int n; cin>>n; Node * tree = new Node[2 * n - 1]; for(int i = 0; i < n; i ++) { cin>>tree[i].c>>tree[i].w; tree[i].tag = 0; } freopen("CON", "r", stdin); Huffman(tree, n); HuffmanCoding(tree, n); HffmanDecoding(tree, n); return 0; }

样解2

#include<iostream> #include<cstdio> using namespace std; typedef struct node { char letter; int parent; int lchird,rchird; int weight; }node; void select(int n,int *s1,int *s2,node *Huffman) { int j,i; int min=INT_MAX; for(i=0;i<n;i++) if(Huffman[i].parent==0&&min>Huffman[i].weight) { min=Huffman[i].weight; j=i; } (*s1)=(*s2)=j; min=INT_MAX; for(i=0;i<n;i++) if(Huffman[i].parent==0&&(*s2)!=i&&Huffman[i].weight<min) { min=Huffman[i].weight; j=i; } (*s2)=j; } void encode(int n,node *Huffman) { int i,s1,s2; s1=s2=0; for(i=n;i<2*n-1;i++) { select(i,&s1,&s2,Huffman); Huffman[i].parent=0; Huffman[i].lchird=s1; Huffman[i].rchird=s2; Huffman[i].weight=Huffman[s1].weight+Huffman[s2].weight; Huffman[s1].parent=Huffman[s2].parent=i; } } void length(node *Huffman,int n) { int len; int p,i; if(n==1) { cout<<Huffman[n-1].letter<<" "<<n<<endl; return; } for(i=0;i<n;i++) { p=i;len=0; while(Huffman[p].parent!=0) { len++; p=Huffman[p].parent; } cout<<Huffman[i].letter<<" "<<len<<endl; } } int main() { int i,j,n,k; //freopen("input.txt","r",stdin); //freopen("output.txt","w",stdout); while(cin>>n) { node *Huffman=new node [2*n+1]; for(i=0;i<n;i++) { cin>>Huffman[i].letter>>Huffman[i].weight; Huffman[i].parent=0; Huffman[i].lchird=Huffman[i].rchird=0; } encode(n,Huffman); length(Huffman,n); if(Huffman!=NULL) delete [] Huffman; } return 0; }