重写的经典huffman算法,本类融合了快速排序,插入排序,压缩阶段:每个assic从根递归写入一个DWORD中,当写满DWORD的32位的时候,写入一次内存压缩快>然后循环

解压过程:每次读取一个DWORD长度数据再反响循环&过滤该从左还是右子树进行还原当到达叶节点时候,读取对应节点的assic编码

再加压与解压末尾时候会出现不满足4个字节的数据,我把它们简称为补码,用来效验最终文件大小.-Huffman algorithm rewrite the classic blend of quick sort, insertion sort, the compression stage: each assic from root recursive write a DWORD When filled DWORD 32-bit write-once memory compression fast>　and cycle decompression process: each read a DWORD length data again repercussions circulation &　filtration that from the left or right subtree restore time when the leaf node is reached, the assic coding and then read the corresponding node pressurization and decompression will appear at the end of time does not meet four bytes of data, I referred to as the complement of the final file size for efficacy.