test.cpp

来自「哈夫曼树的实现.」· C++ 代码 · 共 16 行

#include"Huffman.h"

void main(void)
{
	int i;
	HuffmanTree t;
	HuffmanCode code;
	int w[]={5,29,7,8,14,23,3,11,23};
	char c[]={'0','A','B','C','D','E','F','G','H','I'};
	HuffmanCoding(t,code,w,sizeof(w)/sizeof(w[0]));
	for(i=1;i<=sizeof(w)/sizeof(w[0]);i++)
	printf("The code of %c is %s\n",c[i],code[i]);



}