说明：  哈夫曼编码是哈夫曼树（最优二叉树）在通信编码中的应用。在本程序中，只定义了5个数据的哈夫曼编码，分别输入五个数据的权值，就可以得出最终的哈夫曼编码。
(Huffman coding is Huffman tree (the optimal binary tree) in the communication code of the application. In this program, only the data defined Huffman 5, respectively, the weight of five data input to the final Huffman coding can be drawn.)