hfmmain.cpp

来自「问题描述： 设计哈希表实现电话号码查询系统。 基本要求： 1、设每个记录有下」· C++ 代码 · 共 39 行

#include"hfmHeader.h"

void main() { 
	int flag=1;
activeHuffmanTree HT;
HTNode  HFMT[MAXSIZE];
HuffmanCode *HC;
HC = (HuffmanCode *)malloc(MAXSIZE*sizeof(HuffmanCode)); 

while((flag=Meum())<5)
{
  switch(flag)
  {	
    case 0:SystemInfo( );  break;
	case 1:activeTest(HT,HC);  break;
	case 2:staticTest(HFMT,HC);break;
	case 3:FileCoding(HT,HC);  break;
	case 4:FileDecoding(HT,HC);break;
	default:exit(0);
	}
        printf("\n\n任意键继续...");
        getchar();
}
		








//int w[27]={186,64,13,22,32,103,21,15,47,57,1,5,32,20,57,63,15,1,48,51,80,23,8,18,1,16,1};
//char c[27]={' ','a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'};


}