实例介绍
【实例截图】
【核心代码】
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <windows.h>
typedef struct{
int weight;
char ch;
int parent,lchild,rchild;
}HTNode,*HuffmanTree;
typedef char **HuffmanCode; //存储哈夫曼编码
HuffmanTree HT;
int n = 0;
HuffmanCode HC;
int *w;
char *ch;
void hy();
void youhua();
void welcome(); //操作选择界面
void select(HuffmanTree HT,int j,int &s1,int &s2); //选择parent为0且weight最小的两个结点
void Init(); //输入字符及其权值，建立哈夫曼树
void Encoding(); //编码
void Decoding(); //译码
void Tree_printing(); //打印哈夫曼树
void Print();//打印代码
void HuffmanCoding(HuffmanTree&HT,HuffmanCode &HC,int *w,int n,char *ch);
void Free();//释放动态分配空间
void hy()
{system("color 02");
printf("\n");
printf("\n");
printf("\n");
printf("\t\t\t\t\t欢迎来到哈夫曼编译码器\n");
printf("\t\t\t\t\t正在进入，请稍等 ");Sleep(300);printf("."); Sleep(200);printf("."); Sleep(200);printf(".");Sleep(200);printf(".");
printf("\t\t"); printf(" *\n");
printf("\t\t"); printf(" *\n");
printf("\t\t"); printf(" *\n");
printf("\t\t"); printf(" ***\n");
printf("\t\t"); printf(" * *** *\n");
printf("\t\t"); printf(" * ***** *\n");
printf("\t\t"); printf(" * * ***** * *\n");
printf("\t\t"); printf(" * * ** ********* ** * *\n");
printf("\t\t"); printf(" * ******** ***** ******** *\n");
printf("\t\t"); printf(" **** * * ***** * * ****\n");
printf("\t\t"); printf(" * * * ******* * * *\n");
printf("\t\t"); printf(" * * ******* * *\n");
printf("\t\t"); printf(" * * * * *************** * * * *\n");;
printf("\t\t"); printf(" * ***************************** *\n");
printf("\t\t"); printf(" ******** ** * ******* * ** *********\n");
printf("\t\t"); printf(" *** * * * ******* * * * ***\n");
printf("\t\t"); printf(" * * ** ********* ** * *\n");
printf("\t\t"); printf(" * * ******************* * *\n");
printf("\t\t"); printf(" * * ***************************** * *\n");
printf("\t\t"); printf(" *********** ** ******* ** ***********\n");
printf("\t\t"); printf(" ******** * * * ********* * * * ********\n");
printf("\t\t"); printf("** * * * * ********* * * * * ***\n");
printf("\t\t"); printf(" * *********** * *\n");
printf("\t\t"); printf(" * ********* *\n");
printf("\t\t"); printf(" *********\n");
printf("\t\t"); printf(" *********\n");
printf("\t\t"); printf(" *********\n");
printf("\t\t"); printf(" *********\n");
Sleep(1200);system("cls");
}
void welcome()
{
printf("**************************************\n");
printf("* 请选择如下操作 *\n");
printf("* I.初始化 *\n");
printf("* E.编码 *\n");
printf("* D.译码 *\n");
printf("* P.打印代码文件 *\n");
printf("* T.打印哈夫曼树 *\n");
printf("* Q.退出 *\n");
printf("**************************************\n");
}
void Init()
{
FILE *fp;
int i;
printf("请输入字符个数:\n");
scanf("%d",&n);
while(n<2){
printf("输入的数据有误，请重新输入:\n");
scanf("%d",&n);
}
ch=(char *)malloc(n*sizeof(char));
printf("请输入所有字符:\n");
getchar();
for(i=0;i<n; i)
{
scanf("%c",&ch[i]);
getchar();}
w=(int *)malloc(n*sizeof(int));
printf("请输入这些字符的权值:\n");
for(i=0;i<n; i)
{ scanf("%d",&w[i]);
getchar();
}
HuffmanCoding(HT,HC,w,n,ch);
printf("编码结果如下:\n");
for(i=1;i<=n; i)
printf("%c:%s\n",HT[i].ch,HC[i]);
fp=fopen("hfmTree.txt","w");
fprintf(fp,"%d",n);
for(i=0;i<n; i)
fprintf(fp,"%c",ch[i]);
for(i=0;i<n; i)
fprintf(fp,"%5d",w[i]);
for(i=1;i<=n; i)
fprintf(fp,"\n%c:%s",HT[i].ch,HC[i]);
fclose(fp);
printf("初始化成功\n");
}
void select(HuffmanTree HT,int j,int &s1,int &s2)
{
int i;
for(i=1;i<=j;i )
if(HT[i].parent==0){s1=i;break;}
for (;i<=j;i )
if ((HT[i].parent==0)&&(HT[i].weight<HT[s1].weight))
s1=i;
HT[s1].parent=1;
for(i=1;i<=j;i )
if(HT[i].parent==0){s2=i;break;}
for(;i<=j;i )
if((HT[i].parent==0)&&(i!=s1)&&(HT[i].weight<HT[s2].weight))
s2=i;
}
void HuffmanCoding(HuffmanTree&HT,HuffmanCode &HC,int *w,int n,char *ch)
{
int m;
m=2*n-1;
int j,s1,s2,k;
HT=(HTNode *)malloc((m 1)*sizeof(HTNode));
HTNode *p;
int i;
for(p=HT 1,i=1;i<=n; p, i, w, ch){
p->ch=*ch;
p->weight=*w;
p->parent=p->lchild=p->rchild=0;
}
for(;i<=m; i, p){
p->ch=0;
p->weight=0;
p->parent=p->lchild=p->rchild=0;
}
for(i=n 1;i<=m; i){
select(HT,i-1,s1,s2);
HT[s1].parent=i;HT[s2].parent=i;
HT[i].lchild=s1;HT[i].rchild=s2;
HT[i].weight=HT[s1].weight HT[s2].weight;
}
HC=(char**)malloc((n 1)*sizeof(char*));
char *cd;
cd=(char *)malloc(n*sizeof(char));
cd[n-1]='\0';
int start,c,f;
for(i=1;i<=n; i){
start=n-1;
for(c=i,f=HT[i].parent;f!=0;c=f,f=HT[f].parent){
if(HT[f].lchild==c) cd[--start]='0';
else cd[--start]='1';
}
HC[i]=(char *)malloc((n-start)*sizeof(char));
strcpy(HC[i],&cd[start]);
}
free(cd);
}
void Encoding()
{
FILE *fp,*fp1;
int i;
char in;
if(n==0)
{
fp=fopen("hfmTree.txt","r");
fscanf(fp,"%d",&n);
if(feof(fp)){
printf("请先初始化哈夫曼树！\n");
return ;
}
ch=(char *)malloc(n*sizeof(char));
for(i=0;i<n; i)
fscanf(fp,"%c",&ch[i]);
w=(int *)malloc(n*sizeof(int));
for(i=0;i<n; i)
fscanf(fp,"%d",&w[i]);
HuffmanCoding(HT,HC,w,n,ch);
printf("已载入哈夫曼树！\n");
fclose(fp);
}
fp=fopen("ToBeTran.txt","r");
printf("成功读取ToBeTran.txt\n");
fp1=fopen("CodeFile.txt","w");
fscanf(fp,"%c",&in);
while(!feof(fp))
{
for(i=1;i<=n; i){
if(HT[i].ch==in)
break;
}
fprintf(fp1,"%s",HC[i]);
fscanf(fp,"%c",&in);
}
printf("\n编码结束，结果已存入CodeFile.txt文件中！\n");
fclose(fp);
fclose(fp1);
}
void Decoding()
{
FILE *fp,*fp1;
int i,m;
char in;
if(n==0)
{
fp=fopen("hfmTree.txt","r");
fscanf(fp,"%d",&n);
if(feof(fp)){
printf("请先初始化哈夫曼树！\n");
}
ch=(char *)malloc(n*sizeof(char));
for(i=0;i<n; i)
fscanf(fp,"%c",&ch[i]);
w=(int *)malloc(n*sizeof(int));
for(i=0;i<n; i)
fscanf(fp,"%d",&w[i]);
HuffmanCoding(HT,HC,w,n,ch);
printf("已载入哈夫曼树！\n");
fclose(fp);
}
fp=fopen("CodeFile.txt","r");
fp1=fopen("TextFile.txt","w");
for(i=1;HT[i].parent!=0; i);
m=i;
while(!feof(fp)){
if(HT[m].lchild && HT[m].rchild){
fscanf(fp,"%c",&in);
if(in=='0') m=HT[m].lchild;
else m=HT[m].rchild;
}
else{
fprintf(fp1,"%c",HT[m].ch);
m=i;
}
}
printf("\n译码结束，译码结果已保存到TextFile.txt文件中！\n");
fclose(fp);
fclose(fp1);
}
void Print()
{
FILE *fp,*fp1;
int i=0;
char in;
printf("代码文件为:\n");
fp=fopen("CodeFile.txt","r");
fp1=fopen("CodePrin.txt","w");
fscanf(fp,"%c",&in);
while(!feof(fp))
{
printf("%c",in);
fprintf(fp1,"%c",in);
i ;
if(i==50){
printf("\n");
fprintf(fp1,"\n");
i=0;
}
fscanf(fp,"%c",&in);
}
printf("\n");
fclose(fp);
fclose(fp1);
printf("代码文件已存入CodePrin.txt文件中");
printf("\n");
}
void Tree_printing()
{
FILE *fp;
fp=fopen("TreePrint.txt","w");
int i;
for(i=1;i<2*n;i ){
printf("%c%8d%8d%8d%8d\n",HT[i].ch,HT[i].weight,HT[i].parent,HT[i].lchild,HT[i].rchild);
fprintf(fp,"%c%8d%8d%8d%8d",HT[i].ch,HT[i].weight,HT[i].parent,HT[i].lchild,HT[i].rchild);
fprintf(fp,"\n");
}
fclose(fp);
printf("哈夫曼树已存入TreePrint.txt\n");
}
void Free()
{
free(HT);
free(HC);
free(w);
free(ch);
}
int main()
{
hy();
char choice;
while(1)
{
welcome();
scanf("%c",&choice);
switch(choice)
{
case 'i':
case 'I':Init();break;
case 'e':
case 'E':Encoding();break;
case 'd':
case 'D':Decoding();break;
case 'p':
case 'P':Print();break;
case 't':
case 'T':Tree_printing();break;
case 'q':
case 'Q':Free();printf("程序退出成功，欢迎下次使用。\n");exit(1);
default :printf("Input error!\n");
}
getchar();
}
return 0;
}
小贴士
感谢您为本站写下的评论，您的评论对其它用户来说具有重要的参考价值，所以请认真填写。
- 类似“顶”、“沙发”之类没有营养的文字，对勤劳贡献的楼主来说是令人沮丧的反馈信息。
- 相信您也不想看到一排文字/表情墙，所以请不要反馈意义不大的重复字符，也请尽量不要纯表情的回复。
- 提问之前请再仔细看一遍楼主的说明，或许是您遗漏了。
- 请勿到处挖坑绊人、招贴广告。既占空间让人厌烦，又没人会搭理，于人于己都无利。
关于好例子网
本站旨在为广大IT学习爱好者提供一个非营利性互相学习交流分享平台。本站所有资源都可以被免费获取学习研究。本站资源来自网友分享，对搜索内容的合法性不具有预见性、识别性、控制性，仅供学习研究，请务必在下载后24小时内给予删除，不得用于其他任何用途，否则后果自负。基于互联网的特殊性，平台无法对用户传输的作品、信息、内容的权属或合法性、安全性、合规性、真实性、科学性、完整权、有效性等进行实质审查；无论平台是否已进行审查，用户均应自行承担因其传输的作品、信息、内容而可能或已经产生的侵权或权属纠纷等法律责任。本站所有资源不代表本站的观点或立场，基于网友分享，根据中国法律《信息网络传播权保护条例》第二十二与二十三条之规定，若资源存在侵权或相关问题请联系本站客服人员，点此联系我们。关于更多版权及免责申明参见 版权及免责申明
网友评论
我要评论