#include <stdio.h>
#define MAXBIT 2000 /*定义哈夫曼编码的最大长度*/
#define MAXVALUE 1000 /*定义最大权值*/
#define MAXLEAF 256 /*定义哈夫曼树中最多叶子节点个数*/
#define MAXNODE MAXLEAF*2-1 /*哈夫曼树最多结点数*/
typedef struct { /*哈夫曼编码结信息的构*/
char bit[MAXBIT];
int start;
}Hcodetype;
typedef struct { /*哈夫曼树结点的结构*/
int weight;
int parent;
int lchild;
int rchild;
char ch;
}Hnodetype;
char ch[MAXVALUE*5];
static int numbers;
int number=0;
char varyCh[MAXLEAF];
int weight[MAXLEAF];
int pos[256];
int root;
char allHc[MAXVALUE*20];
/*----------分析输入的字符串--------------*/
void analyze(char ch[],int numbers,char varyCh[],int weight[],int& number){
int temp[256]={0};
int n=0;
for(int i=0;i<numbers;i++){
temp[(int)ch[i]]++;
}
for(int j=0;j<256;j++){
if(temp[j]!=0){
varyCh[n]=(char)j;
weight[n]=temp[j];
pos[j]=n;
n++;
}
}
number=n;
}
void huffmantree(Hnodetype huffnode[MAXNODE]) /*构造哈夫曼树的函数*/
{
int i,j,m1,m2,x1,x2;
analyze(ch,numbers, varyCh, weight,number);
for(i=0;i<number;i++) /*存放哈夫曼树结点的数组huffnode[]初始化*/
{
huffnode[i].weight=weight[i];
huffnode[i].parent=-1;
huffnode[i].lchild=-1;
huffnode[i].rchild=-1;
huffnode[i].ch=varyCh[i];
}
for(i;i<2*number;i++){
huffnode[i].weight=0;
huffnode[i].parent=-1;
