哈夫曼编码 皇星客栈

#include<stdio.h>
#include<stdlib.h>
#include<iostream>
#define MAXVALUE 100                //定义最大权值
#define MAXLEAF 50                  //定义哈夫曼树中叶子节点个数
#define MAXNODE MAXLEAF*2-1
#define MAXBIT  100                 //定义哈夫曼编码的最大长度

typedef struct{
    int weight;
    int parent;
    int lchild;
    int rchild;
    }HNodeType;

typedef struct{
    int bit[MAXBIT];
    int start;
}HCodeType;
    
static int n; 

HNodeType HuffNode[MAXNODE];
HNodeType *HaffmanTree( ){
    int i,j,m1,m2,x1,x2;
    scanf("%d",&n);                     //输入叶子节点个数
    for(i=0;i<2*n-1;i++)          //数组HuffNode[ ]初始化
    {
        HuffNode[i].weight=0;
        HuffNode[i].parent=-1;
        HuffNode[i].lchild=-1;
        HuffNode[i].rchild=-1;
    }
    for(i=0;i<n;i++)
            scanf("%d", &( HuffNode[i].weight));
    for(i = 0 ; i < n - 1 ; i++ ) {
     m1=m2=MAXVALUE;
     x1 = x2 = 0;
     for( j=0 ; j < n + i ; j++ )  
     {
         if(HuffNode[j].parent == -1 && HuffNode[j].weight < m1)
         {   
             m2 = m1;
             x2 = x1;
             m1 = HuffNode[j].weight;
             x1 = j;
         }
         else
            if(HuffNode[j].parent == -1 && HuffNode[j].weight < m2 ){
               m2 = HuffNode[j].weight;                                                                            
               x2 = j;
            }
    }
    HuffNode[x1].parent = n + i;
    HuffNode[x2].parent = n + i;
    HuffNode[n+i].weight = HuffNode[x1].weight + HuffNode[x2].weight;
    HuffNode[n+i].lchild = x1;
    HuffNode[n+i].rchild = x2;
  }
  return HuffNode;
}

void HaffmanCode( ){                  //建立哈夫曼编码
    HCodeType HuffCode[MAXLEAF],cd;
    int i,j,c,p;
    HaffmanTree( );  //建立哈夫曼树
    for( i = 0 ; i < n ; i++ )  //求每个叶子节点的哈夫曼编码
    {
        cd.start = n-1;
        c = i;
        p = HuffNode[c].parent;
        while(p!=-1) {                                     //由叶子节点向上直到树根
        if(HuffNode[p].lchild==c)
         cd.bit[cd.start] = 0;
        else
         cd.bit[cd.start]=1;
        cd.start--;
        c=p;
        p=HuffNode[c].parent;
    }
    for(j=cd.start+1;j<n;j++)
        HuffCode[i].bit[j] = cd.bit[j];          //保存求出的每个叶节点的哈夫曼编码和编码的起始值
    
    HuffCode[i].start = cd.start;
   }
   for( i = 0 ; i < n ; i++ ){                  //输出每个叶子的哈夫曼编码
       for(j = HuffCode[i].start+1 ; j < n ; j++ ) 
             printf("%d",HuffCode[i].bit[j]);
   printf("\n");
  }
}
  
  
  int main( )
  {
      HaffmanCode( );
    return 0;
 }