动态哈夫曼的改进

说明：  来有人提出了一种动态的哈夫曼编码方法。动态哈夫曼编码使用一棵动态变化的哈夫曼树，对第t+1个字符的编码是根据原始数据中前t个字符得到的哈夫曼树来进行的，编码和解码使用相同的初始哈夫曼树，每处理完一个字符，编码和解码使用相同的方法修改哈夫曼树，所以
(was raised to a dynamic Huffman coding method. Dynamic Huffman coding using a dynamic changes in the Huffman tree for the first t a character encoding is based on the original data before t characters in the Huffman tree for the encoding and decoding using the same initial Huffman tree, each dealing with a character encoding and decoding using the same side Law Revision Huffman tree.)