数据结构实验五

#include
#include
using namespace std;
typedef struct{
int weight;
int parent,lchild,rchild;
}htnode,nuffmantree;
int w[101],n;
void Select(nuffmantree HT,int k,int &s1,int &s2){
int sw1=1e9,sw2=1e9;
for(int i=0;i<k-1;i++){
if(HT[i].parent==-1&&HT[i].weight<sw1){
s1=i;
sw1=min(sw1,HT[i].weight);
}
}
for(int i=0;i<k;i++){
if(HT[i].parent==-1&&HT[i].weight<sw2&&HT[i].weight>sw1){
s2=i;
sw2=min(sw2,HT[i].weight);
}
}
}
void createnuffmantree(nuffmantree &HT,int w[],int n){
HT=new htnode[2n-1];
for(int i=0;i<2n-1;i++){
HT[i].parent=HT[i].lchild=HT[i].rchild=-1;
}
for(int i=0;i<n;i++){
HT[i].weight=w[i];
}
for(int k=n;k<2n-1;k++){
int s1,s2;
Select(HT,k,s1,s2);
HT[s1].parent=k;
HT[s2].parent=k;
HT[k].lchild=s1;
HT[k].rchild=s2;
HT[k].weight=HT[s1].weight+HT[s2].weight;
}
}
void creathuffmancode(nuffmantree HT,char ** &HC,int n){
HC=new char *[n];
char *cd=new char[n];
cd[n-1]=‘\0’;
for(int i=0;i<n;i++){
int start=n-1;
int c=i;
int f=HT[i].parent;
while(f!=-1){
start–;
if(HT[f].lchild==c) cd[start]=‘0’;
else cd[start]=‘1’;
c=f;f=HT[f].parent;
}
HC[i]=new char [n-start];
strcpy(HC[i],&cd[start]);
}
delete cd;
}
int main(){
nuffmantree HT;
char **HC;
cout<<“请输入字符个数：”;
cin>>n;
char a[256];
cout<<“请分别输入字符及对应的权值：”<<endl;
for(int i=0;i<n;i++)
cin>>a[i]>>w[i];
createnuffmantree(HT,w,n);
creathuffmancode(HT,HC,n);
for(int i=0;i<n;i++){
cout<<a[i]<<": ";
for(int j=0;j<strlen(HC[i]);j++)
cout<<HC[i][j];
cout<<endl;
}
return 0;
}