Description: 输入一段英文字符，试为该文中的每个字符编制相应的哈夫曼码。
（1）I：初始化（Initialization）。对输入的一段英文中的每个字符统计其权值，建立哈夫曼树；
（2）E：编码（Encoding）。利用已建好的哈夫曼树，对每个字符进行编码。
（3）D：译码（Decoding）。利用已建好的每个编码，对输入的一个由0、1组成的序列进行译码；
（4）P：印代码文件（Print）。将每个字符编的哈夫曼码和译码结果显示在终端上。
-Enter a period of English characters, try the text for each character corresponding Huffman code. (1) I: Initialization (Initialization). A section of the input English characters statistics for each value of its right to establish a Huffman tree (2) E: encoding (Encoding). Has been built using Huffman tree for each character encoding. (3) D: Decoding (Decoding). Use has been completed for each encoding, the input of a sequence consisting of 0,1 Decoding (4) P: Printing code files (Print). Will be allocated for each character code and the Huffman decoding results are displayed in terminal. Platform: |
Size: 2048 |
Author:alic |
Hits:
Search - java huffman code for each charact