#include
#include
#define N 50
#define M 2*N-1
typedef struct
{
char data;
int weight;
int parent;
int lchild;
int rchild;
}HTNode;
typedef struct
{
char cd[N];
int start;
}HCode;
void CreateHT(HTNode ht[],int n)
{
int i,k,lnode,rnode;
int min1,min2;
for(i=0;i<2*n-1;i++)
ht.parent=ht.lchild=ht.rchild=-1;
for(i=n;i<2*n-1;i++)
{
min1=min2=32767;
lnode=rnode=-1;
for(k=0;k<=i-1;k++)
{
if(ht[k].parent==-1)
{
if(ht[k].weight<min1)
{
min2=min1;rnode=lnode;
min1=ht[k].weight;
lnode=k;
}
else if(ht[k].weight<min2)
{
min2=ht[k].weight;
rnode=k;
}
}
}
ht[lnode].parent=i;ht[rnode].parent=i;
ht.weight=ht[lnode].weight+ht[rnode].weight;
ht.lchild=lnode;ht.rchild=rnode;
}
}
void CreateHCode(HTNode ht[],HCode hcd[],int n)
{
int i,f,c;
HCode hc;
for(i=0;i<n;i++)
{
hc.start=n;c=i;
f=ht.parent;
while(f!=-1)
{
if(ht[f].lchild==c)
hc.cd[hc.start--]='0';
else
hc.cd[hc.start--]='1';
c=f;f=ht[f].parent;
}
hc.start++;
hcd=hc;
}
}
void DispHCode(HTNode ht[],HCode hcd[],int n)
{
int i,k;
int sum=0,m=0,j;
printf("output:\n");
for(i=0;i<n;i++)
{
j=0;
printf("
%s:\t",ht.data);
for(k=hcd.start;k<=n;k++)
{
printf("%c",hcd.cd[k]);
j++;
}
m+=ht.weight;
sum+=ht.weight*j;
printf("\n");
}
printf("\npingjunchangduwei=%g\n",1.0*sum/m);
}
void Encode(char *s,HTNode ht[],HCode hcd[],int n)
{
int i,j,k;
for(i=0;i<strlen(s);i++)
{
j=0;
while(s!=ht[j].data)
{
j++;
}
for(k=hcd[j].start;k<=n;k++)
{
printf("%c",hcd[j].cd[k]);
}
}
}
void main()
{
int n=27,i;
char *s;
char str[]={' ','A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'};
int fnum[]={186,64,13,22,32,103,21,15,47,57,1,5,32,20,57,63,15,1,48,51,80,23,8,18,1,16,1};
HTNode ht[M];
HCode hcd[N];
for(i=0;i<n;i++)
{
ht.data=str;
ht.weight=fnum;
}
printf("\n");
CreateHT(ht,n);
CreateHCode(ht,hcd,n);
DispHCode(ht,hcd,n);
printf("\n");
printf("please input s");
gets(s);
Encode(s,ht,hcd,n);
}
调试有错，希望改正，谢谢！
|
