C 最小堆的构建 霍夫曼树的性质 05-树9 Huffman Codes (30分)

05-树9 Huffman Codes (30分)

In 1953, David A. Huffman published his paper “A Method for the Construction of Minimum-Redundancy Codes”, and hence printed his name in the history of computer science. As a professor who gives the final exam problem on Huffman codes, I am encountering a big problem: the Huffman codes are NOT unique. For example, given a string “aaaxuaxz”, we can observe that the frequencies of the characters ‘a’, ‘x’, ‘u’ and ‘z’ are 4, 2, 1 and 1, respectively. We may either encode the symbols as {‘a’=0, ‘x’=10, ‘u’=110, ‘z’=111}, or in another way as {‘a’=1, ‘x’=01, ‘u’=001, ‘z’=000}, both compress the string into 14 bits. Another set of code can be given as {‘a’=0, ‘x’=11, ‘u’=100, ‘z’=101}, but {‘a’=0, ‘x’=01, ‘u’=011, ‘z’=001} is NOT correct since “aaaxuaxz” and “aazuaxax” can both be decoded from the code 00001011001001. The students are submitting all kinds of codes, and I need a computer program to help me determine which ones are correct and which ones are not.

Input Specification:
Each input file contains one test case. For each case, the first line gives an integer N (2≤N≤63), then followed by a line that contains all the N distinct characters and their frequencies in the following format:

c[1] f[1] c[2] f[2] ... c[N] f[N]

where c[i] is a character chosen from {‘0’ - ‘9’, ‘a’ - ‘z’, ‘A’ - ‘Z’, ‘_’}, and f[i] is the frequency of c[i] and is an integer no more than 1000. The next line gives a positive integer M (≤1000), then followed by M student submissions. Each student submission consists of N lines, each in the format:

c[i] code[i]

where c[i] is the i-th character and code[i] is an non-empty string of no more than 63 '0’s and '1’s.

Output Specification:
For each test case, print in each line either “Yes” if the student’s submission is correct, or “No” if not.

Note: The optimal solution is not necessarily generated by Huffman algorithm. Any prefix code with code length being optimal is considered correct.

Sample Input:

7
A 1 B 1 C 1 D 3 E 3 F 6 G 6
4
A 00000
B 00001
C 0001
D 001
E 01
F 10
G 11
A 01010
B 01011
C 0100
D 011
E 10
F 11
G 00
A 000
B 001
C 010
D 011
E 100
F 101
G 110
A 00000
B 00001
C 0001
D 001
E 00
F 10
G 11

Sample Output:

Yes
Yes
No
No

题目
输入的第一行代表数的个数
第二行为给定的元素和权值
第三行为要判定的组数
后面接着每n行一个组

解题关键
1.建立最小堆，把第二行的数据逐个插入最小堆，再另取一个列表保留权值；
2.利用霍夫曼树的建立方法，把最小堆里的头元素两两组合再插回，执行n-1次，便将最小堆转化为霍夫曼树；
3.通过此霍夫曼树，求出最小权值
两部将题目给定的元素建立成了霍夫曼树
接下来要判断后面给的数是否为霍夫曼树
1.最小权值相同
字符串长度*给定字母的权值大小就是该路径的权值；
全部相加即为总权值，与已求权值比较即可；
2.不会出现前缀码重复
构建一个二叉树，若有值则标记；
后面路径路过此值即为前缀码重复；
后面路径终点不为叶节点，也为前缀码重复；

#include<iostream>
#include<cstring>
using namespace std;
#define MaxNum 64

struct TreeNode{
        //树 
	int Weight =0;    //初始化为0
	TreeNode *Left = nullptr;
	TreeNode *Right = nullptr;   //左右为指向下一个tree对象的空指针 
};

struct HeapNode{
   // 堆结构
	TreeNode Data[MaxNum];      //data内放着树结构
	int Size =0;        //初始大小为0 
};

HeapNode * CreateHeap(){
       //建树——返回指向树根节点的指针 
	HeapNode *H = new(HeapNode)