htxt.txt

实现最优二叉树的构造；在此基础上完成哈夫曼编码器与译码器。 假设报文中只会出现如下表所示的字符： 字符 A B C D E F G H I J K L M N 频度 186 64 13 22

WHEN I WAS YOUNG I'D LISTEN TO THE RADIO@WAITING FOR MY FAVORITE SONGS@WHEN THEY PLAYED I'D SING ALONG,@IT MAKE ME SMILE.@