【作业】6.2: 哈夫曼树

最新推荐文章于 2024-09-28 22:05:59 发布

crazzyy

最新推荐文章于 2024-09-28 22:05:59 发布

阅读量131

点赞数 1

文章标签：算法

本文链接：https://blog.csdn.net/crazzyy/article/details/139606958

版权

#include<stdio.h>
#include<string.h>
#include<malloc.h>
typedef struct hnode 
{ int weight;
   int lchild,rchild,parent;
 }HTNode,*HuffmanTree;/*定义二叉树的存储结点*/
typedef char **HuffmanCode;
void Select(HTNode HT[],int len,int &s1,int &s2)//选出权值最小的两个结点，下标通过s1和s2传出去
{
	//printf("jinqu %d \n",len);
    int i,min1=32767,min2=32767;
    for(i=1;i<=len;i++)
    {
        if(HT[i].weight<min1&&HT[i].parent==0)
        {
            s2=s1;
            min2=min1;
            min1=HT[i].weight;
            s1=i;
        }
        else if(HT[i].weight<min2&&HT[i].parent==0)
        {    min2=HT[i].weight;
            s2=i;
        }
    }
}
	void CreateHuffman_tree(HuffmanTree &HT,int n){
	    HT=(HuffmanTree)malloc(sizeof(HTNode)*(n*2));
	    int i=1;
	    int t;
	    //printf("%d",n);	
	    int s1,s2;
	    while(i<=n){
	        scanf("%d",&t);
	        HT[i].weight=t;
	        //printf("%d",t/*HT[i].weight*/);
	        HT[i].parent=0;
	        HT[i].lchild=0;
	        HT[i].rchild=0;
	        i++;
	    }
	    i=n+1;
	    t=n;
	    while(i<=(n*2-1)){
	        Select(HT,t,s1,s2);
	        HT[s1].parent=i;
	        HT[s2].parent=i;
	        HT[i].weight=(HT[s1].weight + HT[s2].weight);
	        HT[i].parent=0;
	        HT[i].lchild=s1;
	        HT[i].rchild=s2;
	        i++;
	        t++;
	    }
	}
void Huffman_code(HuffmanTree HT,HuffmanCode &HC,int n){
	char ss[n];
	int g;
    HC=(char**)malloc(sizeof(char)*(n*2-1));
    int t=0;
    int mid;
    int i=0;
    while(i<=n*2){
        HC[i]=(char*)malloc(sizeof(char)*n);
        t=0;
        while(t<=n){
        	HC[i][t]='\0';
        	t++;
		}
		//printf("%d",strlen(HC[i]));
            i++;
    }
    g=0;
    while(g<n){
    	ss[g]='\0';
    	g++;
	}
    i=n*2-1;
	while(i>n){
		//printf("jin00  ");
		//printf("jinr, %d",HT[i].parent);
		if(HT[i].parent==0){
			//printf("jin1\n");
			HC[HT[i].lchild][0]='0';
			//printf("%s",HC[HT[i].lchild]);
			HC[HT[i].rchild][0]='1';
		}
		else if(HT[i].parent!=0){
			//printf("jin2\n");
			strcpy(ss,HC[i]);
			//printf("%s\n",ss);
			strcpy(HC[HT[i].lchild],ss);
			HC[HT[i].lchild][strlen(ss)]='0';
			HC[HT[i].lchild][strlen(ss)+1]='\0';
			//printf("%s \n",HC[HT[i].lchild]);
			//printf("ss :%s\n",ss);
			strcpy(HC[HT[i].rchild],ss);
			HC[HT[i].rchild][strlen(ss)]='1';
			HC[HT[i].rchild][strlen(ss)+1]='\0';
			//printf("%s \n",HC[HT[i].rchild]);
		}
		/*else{
			HC[HT[i].lchild][strlen(HC[i])]='0';
			HC[HT[i].lchild]=HC[i];
			HC[HT[i].lchild][strlen(HC[i])]='0';
			HC[HT[i].rchild]=HC[i];
		}*/
		i--;
	}
	/*
    while(i<=n){
    	t=HT[i].parent;
    	while(t!=n*2){
    		if(HT[t].lchild==i)
    		HC[i][strlen(HC[i])]='0';
    		else
    		HC[i][strlen(HC[i])]='1';
    		t=HT[t].parent 
		}
    	
	}*/
}

int main()
{
    HuffmanTree HT;
    HuffmanCode HC;
    int i, n;
    scanf("%d",&n);
    CreateHuffman_tree(HT, n);/*建立哈夫曼树*/
    i=1;
    while(i<(n*2)){
    	printf("wight:%d %d %d %d \n",HT[i].weight,HT[i].lchild,HT[i].rchild,HT[i].parent);
    	i++;
	}
    Huffman_code(HT,HC,n);/*哈夫曼树编码*/
    for(i=1;i<=n;i++)/*输出字符、权值及编码*/
       printf("编码是：%s\n",HC[i]);
    return 0;
}