通过最佳的文件压缩比节省空间并加快转移的速度。高效，快速且容易的文件管理！
1 LZMA = 1.667 Huffman
1 Huffman = 0.6 LZMA
例子:
将15 Lemple-Ziv-Markov算法转换为霍夫曼编码压缩：
15 LZMA = 25 Huffman
| Lemple-Ziv-Markov算法 | 霍夫曼编码压缩 |
|---|---|
| 0.01 LZMA | 0.017 Huffman |
| 0.1 LZMA | 0.167 Huffman |
| 1 LZMA | 1.667 Huffman |
| 2 LZMA | 3.333 Huffman |
| 3 LZMA | 5 Huffman |
| 5 LZMA | 8.333 Huffman |
| 10 LZMA | 16.667 Huffman |
| 20 LZMA | 33.333 Huffman |
| 30 LZMA | 50 Huffman |
| 40 LZMA | 66.667 Huffman |
| 50 LZMA | 83.333 Huffman |
| 60 LZMA | 100 Huffman |
| 70 LZMA | 116.667 Huffman |
| 80 LZMA | 133.333 Huffman |
| 90 LZMA | 150 Huffman |
| 100 LZMA | 166.667 Huffman |
| 250 LZMA | 416.667 Huffman |
| 500 LZMA | 833.333 Huffman |
| 750 LZMA | 1,250 Huffman |
| 1000 LZMA | 1,666.667 Huffman |
| 10000 LZMA | 16,666.667 Huffman |
| 100000 LZMA | 166,666.667 Huffman |
规则