haffmantree.cpp

来自「包含各种测试,查找和算法等代码,如冒泡算法,树的遍历,链表,队列,堆栈等」· C++ 代码 · 共 33 行

#include <iostream.h>
#include <stdlib.h>

const int MaxValue = 10000;					//初始设定的权值最大值
const int MaxBit = 4;						//初始设定的最大编码位数
const int MaxN = 10;						//初始设定的最大结点个数

#include "HaffmanTree.h"

void main(void)
{
	int i, j, n = 4;
	int weight[] = {1,3,5,7};
	HaffNode *myHaffTree = new HaffNode[2*n+1];
	Code *myHaffCode = new Code[n];
	if(n > MaxN)
	{
		cout << "定义的n越界，修改MaxN! " << endl;
		exit(0);
	}
	Haffman(weight, n, myHaffTree);
	HaffmanCode(myHaffTree, n, myHaffCode);

	//输出每个叶结点的哈夫曼编码
	for(i = 0; i < n; i++)
	{
		cout << "Weight = " << myHaffCode[i].weight << "   Code = ";
		for(j = myHaffCode[i].start+1; j < n; j++)
			cout << myHaffCode[i].bit[j];
		cout << endl;
	}
}