huffmtree

[fbsh2002]

好多错误，烦～～～


#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <conio.h>
#include <malloc.h>

typedef struct
{
unsigned int weight;
unsigned int parent;
unsigned int lchild;
unsigned int rchild;
}HuffmTree;

typedef char * * HuffmCode;

typedef struct
{
unsigned ch;
unsigned long fr;
}WD;

void select(HuffmTree * HT,int i, int * s1, int * s2);
void HuffmCoding(HuffmTree * HT,HuffmCode * HC,WD w[256],int n)
{
int m,i,j,s1,s2,l,k,start,f,cdlen;
char *cd;
if(n<=1)
return;
m=2*n-1;
HT=(HuffmTree)malloc((m+1)*sizeof(HuffmTree));
for(i=1;i<=n;i++)
{
HT[i].weight=w[i-1].fr;
HT[i].parent=0;
HT[i].lchild=0;
HT[i].rchild=0;
}
for(;i<=m;i++)
{
HT[i].weight=0;
HT[i].parent=0;
HT[i].lchild=0;
HT[i].rchild=0;
}

for(i=n+1;i<=m;i++)
{
select(HT,i-1,&s1,&s2);
HT[s1].parent=i;
HT[s2].parent=1;
HT[i].lchild=s1;
HT[i].rchild=s2;
HT[i].weight=HT[s1].weight+HT[s2].weight;
}

/*从叶子结点到根逆向求每个字符的哈夫曼编码*/
HC[i]=(HuffmCode)malloc((n+1)*sizeof(char *));
cd=(char * )malloc(n*sizeof(char));
cd[n-1]='\0';

for(i=1;i<=n;i++)
{
start=n-1;
k=i;
f=HT[k].parent;
do
{
if(HT[f].lchild==k)
cd[--start]='0';
else
cd[--start]='1';
k=f;
f=HT[f].parent;
}while(f!=0);
for(j=start-1;j>=0;j--)
cd[j]='';
HC[i]=(char *)malloc((n-start)*sizeof(char));
m=0;
for(j=0;j<n;j++)
{
if((cd[j]=='0')||(cd[j]=='1')||(cd[j]=='\0'))
{
HC[i][m]=cd[j];
m++;
}
else
continue;
}
}
free(cd);
}

/*在HT[1..n]选择parent为0且权值最小的两个结点，其序号为s1，s2*/
void select(HuffmTree *HT,int n,int *s1,int *s2)
{
int j;
unsigned long min1,min2;
min1=65535;
for(j=1;j<=n;j++)
{
if((min1>=HT[j].weight)&&(HT[j].parent==0))
min1=HT[j].weight;
}
j=n;

while(j>0)
{
if((min1==HT[j].weight)&&(HT[j].parent==0))
break;
else
j--;
}

s1=j;

min2=65535;
for(j=1;j<=n;j++)
{
if((min2>=HT[j].weight)&&(j!= * s1)&&(HT[j].parent==0))
min2=HT[j].weight;
}
j=n;

while(j>0)
{
if(j== *s1)
{
j--;
continue;
}
else
if((min2==HT[j].weight)&&(HT[j].parent==0))
break;
else
j--;
}

s2=j;
}

[expter]

JF....

[fbsh2002]

？？？
meaning？