PTA7-3 构造哈夫曼树 输入一些单词及其出现的频度，构造一棵哈夫曼树，输出哈夫曼编码的平均码长。

 

7-3 构造哈夫曼树

分数 20

全屏浏览题目

切换布局

作者 张庆

单位 集美大学

输入一些单词及其出现的频度，构造一棵哈夫曼树，输出哈夫曼编码的平均码长。

输入格式:

输入N，表示有N个单词，以下N行，每一行表示一个单词及其频度。

输出格式:

平均码长用浮点数类型表示，保留小数点后5位。

输入样例:

在这里给出一组输入。例如：

11
The 1192
of 677
a 541
to 518
and 462
that 242
he 195
is 190
for 157
His 138
are 124

输出样例:

在这里给出相应的输出。例如：

3.10437

代码长度限制

16 KB

时间限制

400 ms

内存限制

64 MB

下面为哈夫曼树

 代码如下

#define _CRT_SECURE_NO_WARNINGS 1		//能使用strcpy
#include<iostream>
#include<string>
#include <string.h>
using namespace std;

#define MAX 9999999	//极大值

typedef struct
{
	string data;				//数据
	int weight;				//结点的权值
	int parent, lchild, rchild;	//双亲与孩子的下标
}HTNode, * HuffmanTree;

typedef char** HuffmanCode;

void Select(HuffmanTree& HT, int n, int* m1, int* m2);
void createHuffmanTree(HuffmanTree& HT, int n);
void HuffmanCoding(HuffmanTree ht, char** hc, int n);

void createHuffmanTree(HuffmanTree& HT,int n)
{
	if (n == 0) return;
	HT = new HTNode[2 * n];
	for (int i = 1; i < 2 * n; ++i) {
		HT[i].parent = 0;
		HT[i].lchild = 0;
		HT[i].rchild = 0;
		HT[i].weight = 0;
	}
	for (int i = 1; i <=  n; ++i) {
		cin >> HT[i].data >> HT[i].weight;
	}

	int m1, m2;
	for (int i = n + 1; i < 2 * n; ++i) {
		Select(HT, i - 1, &m1, &m2);
		HT[i].weight = HT[m1].weight + HT[m2].weight;
		HT[m1].parent = i;
		HT[m2].parent = i;
		HT[i].lchild = m1;
		HT[i].rchild = m2;
	}
}

void Select(HuffmanTree& HT, int top, int* m1, int* m2)
{
	int min= MAX;
	for (int i = 1; i <= top; ++i) {
		if (HT[i].weight < min && HT[i].parent == 0) {
			min = HT[i].weight;
			*m1 = i;
		}
	}
	min = MAX;
	for(int i = 1;i<=top;++i){
		if (HT[i].weight < min && i!=*m1 && HT[i].parent == 0) {
			min = HT[i].weight;
			*m2 = i;
		}
	}
}

void HuffmanCoding(HuffmanTree ht, char** hc, int n)
{
	char* cd = new char[n];
	cd[n - 1] = '\0';
    int now = 1;
	int p = 0;
	int start;
	int i = 0;
	while (i < n) {
		start = n - 1;
		now = i + 1;
		p = ht[now].parent;
		while (p != 0) {
			start--;
			if (ht[p].lchild == now) cd[start] = '0';
			else cd[start] = '1';
			now = p;
			p = ht[now].parent;
		}
		hc[i] = new char[n - start];
		strcpy(hc[i], &cd[start]);
		i++;
	}
	delete[] cd;
}

int main()
{
	int n;
	cin >> n;
	if (n == 0) {
		cout << 0 << endl;
		return 0;
	}
	if (n == 1) {	// 这里被坑了半天QAQ  因为有2个测试点，所以猜测第二个为只有一个结点的树 
                    // 这样比在上面代码里改要快，以后有时间再在上面一坨里改吧(???)
		char ch;
		double temp;
		cin >> ch >> temp;
		printf("%.5f", temp);
	}
	HuffmanTree HT;
	char** HC = new char* [n];
	createHuffmanTree(HT, n);
	HuffmanCoding(HT, HC, n);
	double sum = 0;
	double avg = 0;
	double fre = 0;
	for (int i = 1; i <= n; i++) {
		sum = sum + HT[i].weight;
	}
	for (int i = 1; i <= n; i++) {
		fre = (strlen(HC[i - 1])) * (HT[i].weight);
		avg = avg + fre;
	}
	printf("%.5f", avg / sum);
	return 0;
}