考虑霍夫曼每个选择的是最小的两个频率（..

时考虑到在哈夫曼中要每次挑选两个频率最小（即出现次数最小，我那个hNode里的value 是出现的次数），很自然的就想到了std::priority_queue容器，优先队列每次都会弹出队列 中权值最高的元素，这个特性无疑是实现哈夫曼算法的最佳选择。 ... -to consider the Huffman each selected to be the smallest two frequencies (that is, the minimum number, which I hNode"s value is the number of occurrences), it is natural to think of the std : : priority_queue containers, each priority queue queue will pop the top right elements, the Characteristics undoubtedly Huffman algorithm is the best choice. ...

lz77
Debug
main.cpp
Lz77.h
Lz77.cpp
lz77.001
lz77.ncb
lz77.plg
Lz77.dsp
Lz77.opt
Lz77.dsw