匿名用户

1级

2014-11-15 回答

这是我当时做的作业题，就是数据结构书上的那道题。不知道是否和你说的是同样一道题，代码如下：

/*

HuffmanCodeBYTurboC2.0

Filename:Huffman.c

Author:dcyu.

Ver1.00

*/

#include

#include

#include

#include

#include

typedefstruct{

unsignedintweight;

unsignedintparent,lchild,rchild;

}HTNode,*HuffmanTree;

typedefchar**HuffmanCode;

typedefstruct{

unsignedints1;

unsignedints2;

}MinCode;

voidError(char*message);

HuffmanCodeHuffmanCoding(HuffmanTreeHT,HuffmanCodeHC,unsignedint*w,unsignedintn);

MinCodeSelect(HuffmanTreeHT,unsignedintn);

voidError(char*message)

{

fprintf(stderr,"Error:%s\n",message);

exit(1);

}

HuffmanCodeHuffmanCoding(HuffmanTreeHT,HuffmanCodeHC,unsignedint*w,unsignedintn)

{

unsignedinti,s1=0,s2=0;

HuffmanTreep;

char*cd;

unsignedintf,c,start,m;

MinCodemin;

if(n<=1)Error("Codetoosmall!");

m=2*n-1;

HT=(HuffmanTree)malloc((m+1)*sizeof(HTNode));

for(p=HT,i=0;i<=n;i++,p++,w++)

{

p->weight=*w;

p->parent=0;

p->lchild=0;

p->rchild=0;

}

for(;i<=m;i++,p++)

{

p->weight=0;

p->parent=0;

p->lchild=0;

p->rchild=0;

}

for(i=n+1;i<=m;i++)

{

min=Select(HT,i-1);

s1=min.s1;

s2=min.s2;

HT[s1].parent=i;

HT[s2].parent=i;

HT[i].lchild=s1;

HT[i].rchild=s2;

HT[i].weight=HT[s1].weight+HT[s2].weight;

}

printf("HTList:\n");

printf("Number\t\tweight\t\tparent\t\tlchild\t\trchild\n");

for(i=1;i<=m;i++)

printf("%d\t\t%d\t\t%d\t\t%d\t\t%d\n",

i,HT[i].weight,HT[i].parent,HT[i].lchild,HT[i].rchild);

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);

returnHC;

}

MinCodeSelect(HuffmanTreeHT,unsignedintn)

{

unsignedintmin,secmin;

unsignedinttemp;

unsignedinti,s1,s2,tempi;

MinCodecode;

s1=1;s2=1;

for(i=1;i<=n;i++)

if(HT[i].parent==0)

{

min=HT[i].weight;

s1=i;

break;

}

tempi=i++;

for(;i<=n;i++)

if(HT[i].weight

{

min=HT[i].weight;

s1=i;

}

for(i=tempi;i<=n;i++)

if(HT[i].parent==0&&i!=s1)

{

secmin=HT[i].weight;

s2=i;

break;

}

for(i=1;i<=n;i++)

if(HT[i].weight

{

secmin=HT[i].weight;

s2=i;

}

if(s1>s2)

{

temp=s1;

s1=s2;

s2=temp;

}

code.s1=s1;

code.s2=s2;

returncode;

}

voidmain()

{

HuffmanTreeHT=NULL;

HuffmanCodeHC=NULL;

unsignedint*w=NULL;

unsignedinti,n;

printf("Inputn:\n");

scanf("%d",&n);

w=(unsignedint*)malloc((n+1)*sizeof(unsignedint*));

w[0]=0;

printf("Enterweight:\n");

for(i=1;i<=n;i++)

{

printf("w[%d]=",i);

scanf("%d",&w[i]);

}

HC=HuffmanCoding(HT,HC,w,n);

printf("HuffmanCode:\n");

printf("Number\t\tWeight\t\tCode\n");

for(i=1;i<=n;i++)

printf("%d\t\t%d\t\t%s\n",i,w[i],HC[i]);

}