数据结构-哈夫曼编码

#include <iostream>
#include<string.h>
#include<stdio.h>
using namespace std;
typedef struct
{
    char data[5];
    int weight;
    int parent;
    int lchild;
    int rchild;
}HTNode;
typedef struct
{
    char cd[100];
    int start;
}HCode;
void CreateHT(HTNode ht[],int n)
{
    int lnode,rnode;
    double min1,min2;
    for(int i=0;i<2*n-1;i++)
        ht[i].parent=ht[i].lchild=ht[i].rchild=-1;
    for(int i=n;i<2*n-1;i++)
    {
        min1=min2=32767;
        lnode=rnode=-1;
        for(int 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[i].weight=ht[lnode].weight+ht[rnode].weight;
        ht[i].lchild=lnode;ht[i].rchild=rnode;
        ht[lnode].parent=i;ht[rnode].parent=i;
    }
}
void CreateHCode(HTNode ht[],HCode hcd[],int n)
{
    int f,c;
    HCode hc;
    for(int i=0;i<n;i++)
    {
        hc.start=n;c=i;
        f=ht[i].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[i]=hc;
    }
}
void DispHCode(HTNode ht[],HCode hcd[],int n)
{
    int sum=0,m=0,j;
    for(int i=0;i<n;i++)
    {
        j=0;
        cout<<ht[i].data<<":";
        for(int k=hcd[i].start;k<=n;k++)
        {
            cout<<hcd[i].cd[k];
            j++;
        }
        m+=ht[i].weight;
        sum+=ht[i].weight*j;
        cout<<endl;
    }
    cout<<"平均长度:"<<sum/m;
}
int main()
{
    int n=15;
    char str[][5]={"The","of","a","to","and","in","that","he","is","at","on","for","His","are","be"};
    int fnum[]={1192,677,541,518,462,450,242,195,190,181,174,157,138,124,123};
    HTNode ht[50];
    HCode hcd[99];
    for(int i=0;i<n;i++)
    {
        strcpy(ht[i].data,str[i]);
        ht[i].weight=fnum[i];
    }
    CreateHT(ht,n);
    CreateHCode(ht,hcd,n);
    DispHCode(ht,hcd,n);
    return 0;
}

猜你喜欢

转载自blog.csdn.net/zw159357/article/details/79916001