数据结构课程设计（c++) 3号题

#include<stdio.h>#define N 27       //空格+26个大写字母#define M 2*N-1#define infinity 32767struct node                //huffman树的结点结构{int weight;            //结点权值int plink,llink,rlink;           //双亲，左孩子，右孩子};struct codetype           //huffman编码结构{int start;               //起始位置char bits[N+1];        //存放0，1的数组};struct element            //字符及其编码的结构{char symbol;             //字符struct codetype code;         //字符编码};struct node tree[M+1];            //n个结点的huffman树struct element table[N+1],t[100];        //n个结点的huffman编码表，报文编码int x1,x2;void sethuftree();                   //有关函数声明void select0(int s);void sethufcode();void setcode();void printtree();void printhufcode();void main()                     //**********主函数**********{sethuftree();printtree();sethufcode();printhufcode();setcode();printf("\n\n");}void sethuftree()       //建立huffuman树{int i,treeweight={186,63,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 tablesymbol={' ','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'};for(i=1;i<=M;i++)                   //初始双亲，左，右结点为：0tree[i].plink=tree[i].llink=tree[i].rlink=0;for(i=1;i<=N+1;i++)        //初始化27个字符及其权值{table[i].symbol=tablesymbol[i-1];tree[i].weight=treeweight[i-1];}for(i=N+1;i<=M;i++)               //找权值最小的2个结点，组成huffman树{select0(i-1);            //调用找权值最小的2个结点函数tree[x1].plink=i;tree[x2].plink=i;tree[i].llink=x1;tree[i].rlink=x2;tree[i].weight=tree[x1].weight+tree[x2].weight;}}void select0(int s)              //找权值最小的2个结点{int i;float v1,v2;v1=v2=infinity;x1=x2=0;for(i=1;i<=s;i++)if(tree[i].plink==0)if(tree[i].weight<v1){v2=v1;x2=x1;v1=tree[i].weight;x1=i;}else if(tree[i].weight<v2){v2=tree[i].weight;x2=i;}}void printtree()            //输出huffman树{int i;printf("哈夫曼树为:\n\n");printf("结点值 权值（频度） 双亲   左孩子  右孩子\n");for(i=1;i<=N;i++)printf("  %-8c%-11d%-8d%-8d%d\n",table[i].symbol,tree[i].weight,tree[i].plink,tree[i].llink,tree[i].rlink);for(i=N+1;i<=M;i++)printf("\t  %-11d%-8d%-8d%d\n",tree[i].weight,tree[i].plink,tree[i].llink,tree[i].rlink);printf("\n\n------------------------------------------------------------------\n\n\n");}void sethufcode()           //建立huffman编码{int i,s,f,k=1;struct codetype c;for(i=1;i<=N;i++){c=table[i].code;c.start=N+1;s=i;f=tree[s].plink;do{c.start--;if(s==tree[f].llink)c.bits[c.start]='0';elsec.bits[c.start]='1';s=f;f=tree[s].plink;}while(f);table[i].code=c;}}void printhufcode()                   //输出huffman编码，即空格+26个大写字母{int i,j;struct codetype c;printf("编码为：\n");for(i=1;i<=N;i++){printf("%c:",table[i].symbol);c=table[i].code;for(j=c.start;j<=N;j++)printf("%c",c.bits[j]);printf("\n");}printf("\n\n--------------------------------------------------------------------\n\n");}void setcode()                  //对字符进行编码{int i,j,count;char c0,k='Y';struct codetype c;while(k=='Y')                   //利用循环，实现对字符多次编码{printf("\n\n请输入需要加密的字符（大写字母+空格,不超过100），输入'.'(+回车)号结束\n\n");for(i=1;i<=100;i++)           //利用循环，实现对字符输入