C语言-赫夫曼编码

赫夫曼编码

#include<stdio.h>
#include<stdlib.h>
typedef struct {
	unsigned int weight;
	unsigned int parent, lchild, rchild;
}HTNode, * HuffmanTree;
typedef char** HuffmanCode;
void Select(HuffmanTree HT, int i, int* s1, int* s2);
void strcpy1(char** HC, char* cd, int n, int m, int j) {
	for (int i = 0; i < m; i++, n++) {
		HC[j][i] = cd[n];
	}
}
char ch[100];
int k=0;
void HuffmanCodin(HuffmanTree HT, HuffmanCode HC, int* w, int n) {
	if (n <= 1)return;
	int m = 2 * n - 1;
	HT = (HuffmanTree)malloc((m + 1) * sizeof(HTNode));
	HuffmanTree p;
	int i;
	for (p = HT + 1, i = 1; i <= n; ++i, ++p)
	{
		//*p={*w,0,0,0};
		(*p).weight = *(w + i - 1);
		(*p).parent = 0;
		(*p).lchild = 0;
		(*p).rchild = 0;

	}
	
	for (; i <= m; i++, ++p) {
		//*p={0,0,0,0};
		(*p).weight = 0;
		(*p).parent = 0;
		(*p).lchild = 0;
		(*p).rchild = 0;
	}
	
	int s1, s2;

	for (i = n + 1; i <= m; ++i) {
		int s1 = 0, s2 = 0;
		Select(HT, i - 1, &s1, &s2);

		if (s1 > s2) {
			int temp = s1;
			s1 = s2;
			s2 = temp;
		}
		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;
	}
	printf("赫夫曼表:\n");
	printf("+---------------+\n");
	printf("| w | p | l | r |\n");
	printf("+---------------+\n");
	for (p = HT + 1, i = 1; i <= m; ++i, ++p) {
		printf("|%3d|%3d|%3d|%3d|\n", (*p).weight, (*p).parent, (*p).lchild, (*p).rchild);
		printf("+---------------+\n");
	}
	HC = (HuffmanCode)malloc((n + 1) * sizeof(char*));
	char* cd;
	cd = (char*)malloc(n * sizeof(char));
	cd[n - 1] = '\0';
	int start;
	int c, f;
	printf("赫夫曼编码:\n");
	for (i = 1; i <= n; ++i) {
		start = n - 1;
		for (c = i, f = HT[i].parent; f != 0; c = f, f = HT[f].parent)
			if (HT[f].lchild == c) cd[--start] = '0';
			else cd[--start] = '1';
		HC[i] = (char*)malloc((n - start) * sizeof(char));
		strcpy1(HC, cd, start, n - start, i);
		printf("%c:%s",ch[k++],HC[i]);
		printf("\n");
	}
	free(cd);
	printf("编码成功完成\n");
}

void Select(HuffmanTree HT, int i, int* s1, int* s2) {
	int max = 9999;
	HuffmanTree p;
	int j;
	for (p = HT + 1, j = 1; j <= i; j++, p++) {
		if (max > (*p).weight && (*p).parent == 0) {
			max = (*p).weight;
			(*s1) = j;
		}
	}

	max = 9999;
	for (p = HT + 1, j = 1; j <= i; j++, p++) {
		if (max > (*p).weight && j != (*s1) && (*p).parent == 0) {
			max = (*p).weight;
			(*s2) = j;
		}

	}
	
}

int main() {
	HuffmanTree HT = NULL;
	HuffmanCode HC = NULL;
	int n;
	int array[100];
	printf("输入结点的数量是多少：\n");
	scanf("%d", &n);
	getchar();
	printf("输入结点所代表的的符号\n");
	for (int i = 0; i < n; i++) {
		scanf("%c", &ch[i]);
		getchar();
	}
	printf("输入结点具有的比重：\n");
	for (int i = 0; i < n; i++) {
		scanf("%d", &array[i]);
	}
	HuffmanCodin(HT, HC, array, n);
	return 0;
}