c++ - 利用Huffman编码如何实现压缩算法？求指点！

Answer 1

Please read my log:
[Huffman Tree (C++ Encapsulation)] One algorithm per day, while recalling the details of the algorithm, I picked up C++ and the experimental program as a souvenir. Huffman tree concept Huffman tree is also called the optimal binary tree. It is the binary tree with the smallest weighted path length WPL among the binary trees composed of n weighted leaf nodes. Because the algorithm for constructing this tree is... -- Shared from SegmentFault Original link: https://segmentfault.com/a/1190000002472...

Answer 2

https://github.com/junhuster/...
This link contains the source code of a small program for compressing and decompressing files. Can compress files in any format: including pdf, exe, rmvb, jpg, etc. Because no matter what format the file is, it is a series of 8-bit disk files. From this perspective, the differences in upper-layer formats can be shielded.
The code analysis blog link is here: http://blog.csdn.net/junhuste...