哈夫曼编码（有瑕疵，还有许多不足，试着写了一下）

最新推荐文章于 2024-09-17 14:30:13 发布

Lonely⇔Mars

最新推荐文章于 2024-09-17 14:30:13 发布

阅读量105

点赞数

文章标签：数据结构

本文链接：https://blog.csdn.net/qq_62371917/article/details/125550455

版权

#include<stdio.h>
#include <string.h>
#include<malloc.h>
# define N 30						//叶子结点的最大值
# define M 2 * N - 1               //所有结点的最大值
#define MAX 99999

//定义结构体变量
typedef struct {
	int weight;          //结点的权值
	int parent;         //双亲的下标
	int lchild;        //左孩子结点的下标
	int rchild;       //右孩子结点的下标
}HTNode, *HuffmanTree;

//哈弗曼编码存储变量（全局变量）
typedef  char** HuffmanCode;
int weight[26] = { 0 };
int c[26] = {0};

void Select(HuffmanTree HT, int n, int* s1, int* s2)//在HT[1]到HT[2]的范围内选择了两个父结点为0且weight最小，然后分别给定序号为s1,s2
{        
	int i, min1 = MAX, min2 = MAX;
	*s1 = 0;
	*s2 = 0;
	for (i = 1; i <= n; i++) {
		if (HT[i].parent == 0) {
			if (HT[i].weight < min1) {
				min2 = min1;
				*s2 = *s1;
				min1 = HT[i].weight;
				*s1 = i;
			}
			else if (HT[i].weight < min2) {
				min2 = HT[i].weight;
				*s2 = i;
			}
		}
	}
}

//构造哈弗曼树的函数
void CreatHuffmanTree(HuffmanTree& HT, int n)//n：字符种类
{
	int m, i, k, s1, s2;
	if (n <= 1) return;
	m = 2 * n - 1;
	HT = new HTNode[m + 1];
	for (i = 1; i <= m; ++i)
	{
		HT[i].parent = 0;
		HT[i].lchild = 0;
		HT[i].rchild = 0;
	}
	for (k = 0, i = 1; i <= n; i++, k++)
	{
		while (weight[k] == 0)
			k++;
		if (weight[k] != 0)
		{
			HT[i].weight = weight[k];
			c[i] = k + 'a';
		} //不区分大小写
	}//数组C用来存储使用的字符与I的对应关系
	for (i = n + 1; i <= m; ++i)//自己补充函数定
	{
		Select(HT, i - 1, &s1, &s2);
		HT[s1].parent = i;
		HT[s2].parent = i;
		HT[i].lchild = s1;
		HT[i].rchild = s2;
		HT[i].weight = HT[s1].weight + HT[s2].weight;
	}
}

//根据树求哈弗曼编码
void CreatHuffmanCode(HuffmanTree HT, HuffmanCode HC,int n)
{//从叶子结点到根，逆向求n个中每个叶子结点对应的哈夫曼编码
	int i, c, m;
	char* cd,start;//分配当前编码的工作空间
	HC = new char* [n + 1];
	cd = new char[n];
	cd[n-1]='\0';
	for (i = 1; i <= n; ++i)
	{
		start = n - 1;
		c = i;
		m= HT[i].parent;
		while (m!= 0)
		{
			--start;
			if (HT[m].lchild == c) cd[start] = '0';
			else cd[start] = '1';
			c = m;
			m= HT[m].parent;
		}
		for (int j = 0; j < n; j++) {
			if (cd[j] == '0' || cd[j] == '1') {
				printf("%c", cd[j]);
			}
		}
		printf("\n");
		memset(cd, -1, n);
	}
	delete cd;
}

//主函数
int main()
{
	char s[400] = "ASDFGasdfghaaa";
	HuffmanTree HT;//定义一个哈弗曼树变量
	HuffmanCode HC;
	int i, k, n, j;
	i = 0;
	while (s[i] != '\0')
	{
		if (s[i]>=97&&s[i]<=122)                   //小写字母
			k=s[i]-'a';
		if (s[i]>=65&&s[i]<=90)                    //大写字母
			k=s[i]-'A';
		weight[k]++;
		i++;
	}
	n = 0;//n：字符种类
	for (i = 0; i < 26; i++)
		if (weight[i] != 0) n++;
	CreatHuffmanTree(HT, n);//调用构造哈弗曼树的函数
	CreatHuffmanCode(HT,HC,n);//调用哈弗曼编码函数
	printf("s中出现的字母及频数如下（不区分大小写）\n");
	for (k = 1; k < 26; k++)
		printf("%c", c[k]);
	printf("\n");
	for (i = 0; i < 26; i++)
		if (weight[i] != 0)
			printf("%d", weight[i]);
	printf("\n");
	for (j = 1, k = 1; j <= n, k < 26; j++, k++)
		printf("%c的哈夫曼编码为：%s\n", c[k], HC[j]);
	
	return 0;
}