利用赫夫曼编码的实现原理码对数据进行无损压缩，设计一个实现Huffman压缩的编码和解码的程序。具体要求如下：读入待压缩的文本文件；

2）统计分析文本文件中各字符的出现频度，以频度作为构造Huffman树的权值。根据各字符出现的不同频度构造Huffman树，然后规定每种字符的Huffman编码。再次读入待压缩的文本文件，然后根据各字符的Huffman编码逐一替代，将得到的编码流写入到新的文件中，并且计算压缩率。

5）解码过程：先读入上一步骤得到的新文件，将其看作比特流，根据Huffman树，对比特流逐位译码，将解码结果又写入一个新的文件中。

-The principle use of Huffman coding for lossless compression of the data code to design an implementation of Huffman compression encoding and decoding process. Specific requirements are as follows: read the text file to be compressed　2) Statistical Analysis text file frequency of appearance of each character in frequency as the Huffman tree structure weights. According to the difference of the frequency of characters appear Huffman tree structure, and Huffman coding required for each character. Reads again the text file to be compressed, and then Huffman coding each character one by one alternative, the resulting encoded stream is written to the new file, and the calculated compression ratio. 5) decoding process: first step to get a read on the new file it as a bit stream, according to the Huffman tree for the bit-by-bit stream decoding, the decoded result has written to a new file.