main.c

来自「求哈夫曼树的代码」· C语言 代码 · 共 76 行

#include"head.h"
#include"show.h"
main(){
     int i=0,n=28;
	 int w[28]={2,4,4,5,2,5,10,5,2,2,5
	 ,10,1,4,3,11,1
	 ,1,3,11,1,4,1,3,1,1,1,2};
	 char*str1, *str;
	 char c[28]={'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',' ','.'};
	 int j;
	 char key;
	 HuffmanTree HT; 
	 HuffmanCode HC;
	while(1){
		 if (i<0) i=6;
		 if (i>6) i=1;
         key=showmenu(i);
		 system("cls");
		 if (key=='a'||key=='A'||(key==13&&i==1))
			 HuffmanCoding(&HT,&HC,w,c,n);
		 if (key=='b'||key=='B'||(key==13&&i==2))
			 Encoding(HT,HC,n);
		 if(key=='c'||key=='C'||(key==13&&i==3))
			 Uncoding(HT,HC,n);
		 if(key=='d'||key=='D'||(key==13&&i==4))
			 printfile();
		 if(key=='e'||key=='E'||(key==13&&i==5))
			 print(HT,HC,n);
		 if(key=='f'||key=='F'||(key==13&&i==6))
			 exit(0);
		 if(key==72)
			i--;
		 if(key==80)
			  i++;
		 if(key==75)
			i--;
		 if(key==77)
			  i++;
		
	}
	 
	print(HT,HC,n); 

    getch();
    return 1;
}

//char *a;
//
//a=readfile(".\\in.txt");
//writefile(a,".\\out.txt");
//printf("%s",a);
//msg("请键入您要进行的操作：");
//system("cls");
	//Stack s1;
	//Stack *s;
	//s=&s1;
	//s=InitS(s);
	//Push(s,'a');Push(s,'a');
	//printf("%d\n",Gettop(s));
	//Push(s,'b');
	//printf("%d\n",Gettop(s));
	//Pop(s);
	//printf("%d\n",Gettop(s));
 //   Pop(s);
	//DestS(s);
	//getch();