哈夫曼编码的实现

// aa.cpp : 定义控制台应用程序的入口点。//#include "stdafx.h"#include <stdlib.h>#include <stdio.h>#include <string.h> typedef struct{unsigned int weight;unsigned int parent,lchild,rchild;} HTNode,*HuffmanTree;typedef char ** HuffmanCode;#define Orderint min(HuffmanTree t,int i){int j,m;unsigned int k=UINT_MAX;for(j=1;j<=i;j++){if(t[j].weight<k&&t[j].parent==0){k=t[j].weight;m=j;}}t[m].parent=1;return m;}void select(HuffmanTree t,int i,int &s1,int &s2){#ifdefOrderint j;#endifs1=min(t,i);s2=min(t,i);#ifdef Orderif(s1>s2){j=s1;s1=s2;s2=j;}#endif}void HuffmanCoding(HuffmanTree &HT,HuffmanCode &HC,int *w,int n){int start;unsigned f;int m,i,s1,s2;unsigned c;HuffmanTree p;char *cd;if(n<=1)return ;m=n*2-1;HT=(HuffmanTree)malloc((m+1)*sizeof(HTNode));for(p=HT+1,i=1;i<=n;i++,p++,w++){(*p).weight=*w;(*p).parent=0;(*p).lchild=0;(*p).rchild=0;}for(;i<=m;i++,p++){(*p).parent=0;}for(i=n+1;i<=m;i++){select(HT,i-1,s1,s2);HT[s1].parent=HT[s2].parent=i;HT[i].lchild=s1;HT[i].rchild=s2;HT[i].weight=HT[s1].weight+HT[s2].weight;}HC=(HuffmanCode)malloc((n+1)*sizeof(char*));cd=(char *)malloc(n*sizeof(char));cd[n-1]='\0';for(i=1;i<=n;i++){start=n-1;for(c=i,f=HT[i].parent;f!=0;c=f,f=HT[f].parent){if(HT[f].lchild==c)cd[--start]='0';elsecd[--start]='1';}HC[i]=(char*)malloc((n-start)*sizeof(char));strcpy(HC[i],&cd[start]);}free(cd);}int _tmain(int argc, _TCHAR* argv[]){HuffmanTree HT;HuffmanCode HC;int *w,n,i;printf("请输入权值的个数（>1）:");scanf("%d",&n);w=(int *)malloc(n*sizeof(int));printf("请依次输入%d个权值（整数）:\n",n);for(i=0;i<n;i++)scanf("%d",w+i);//printf("very good");HuffmanCoding(HT,HC,w,n);for(i=1;i<=n;i++)puts(HC[i]);return 0;}