哈夫曼编码毕业论文

1.赫夫曼编码的设计与实现（C++）

哈弗曼树的构造和编码#include int n; class Huffcode { public: char std[20]; int start; }; class Huffman { public: int left; int right; int parent; char val; int weight; }; Huffcode q[20]; Huffman p[40]; //p=new Huffman [n]; void creatcode(Huffman *p) { int i; Huffcode d; // d.std=new char [n]; //q=new Huffcode [n]; //for(i=0;i>p[i].val>>p[i].weight; } for(int j=n;j<2*n;j++) { int temp1,temp2,l,r; temp1=temp2=32567; l=r=0; for(i=0;i>n;// p=new Huffman [n]; //k.getnum(); creat(); creatcode(p); display(); }。

2.赫夫曼编码的设计与实现（C++）

哈弗曼树的构造和编码#include int n;class Huffcode{public: char std[20]; int start;};class Huffman{public: int left; int right; int parent; char val; int weight;}; Huffcode q[20]; Huffman p[40]; //p=new Huffman [n]; void creatcode(Huffman *p) { int i; Huffcode d; // d.std=new char [n]; //q=new Huffcode [n]; //for(i=0;i>p[i].val>>p[i].weight; } for(int j=n;j<2*n;j++) { int temp1,temp2,l,r; temp1=temp2=32567; l=r=0; for(i=0;i>n;// p=new Huffman [n]; //k.getnum(); creat(); creatcode(p); display();}。

3.急

#include<string.h> #include<stdlib.h> #include<stdio.h> int m,s1,s2; typedef struct { unsigned int weight; unsigned int parent,lchild,rchild; }HTNode,*HuffmanTree； //动态分配数组存储哈夫曼树 typedef char *HuffmanCode； //动态分配数组存储哈夫曼编码表 void Select(HuffmanTree HT,int n) { int i,j; for(i = 1;i <= n;i++) if(!HT[i].parent){s1 = i;break;} for(j = i+1;j <= n;j++) if(!HT[j].parent){s2 = j;break;} for(i = 1;i <= n;i++) if((HT[s1].weight>HT[i].weight)&&(!HT[i].parent)&&(s2!=i))s1=i; for(j = 1;j <= n;j++) if((HT[s2].weight>HT[j].weight)&&(!HT[j].parent)&&(s1!=j))s2=j; } void HuffmanCoding(HuffmanTree &HT, HuffmanCode HC[], int *w, int n) { // 算法6.13 // w存放n个字符的权值（均>0），构造哈夫曼树HT， // 并求出n个字符的哈夫曼编码HC int i, j; char *cd; int p; int cdlen; if (n<=1) return; m = 2 * n - 1; HT = (HuffmanTree)malloc((m+1) * sizeof(HTNode)); // 0号单元未用 for (i=1; i<=n; i++) { //初始化 HT[i].weight=w[i-1]; HT[i].parent=0; HT[i].lchild=0; HT[i].rchild=0; } for (i=n+1; i<=m; i++) { //初始化 HT[i].weight=0; HT[i].parent=0; HT[i].lchild=0; HT[i].rchild=0; } puts("\n哈夫曼树的构造过程如下所示：")； printf("HT初态：\n 结点 weight parent lchild rchild"); for (i=1; i<=m; i++) printf("\n%4d%8d%8d%8d%8d",i,HT[i].weight, HT[i].parent,HT[i].lchild, HT[i].rchild); printf（" 按任意键，继续 。

"）； getchar(); for (i=n+1; i<=m; i++) { // 建哈夫曼树 // 在HT[1..i-1]中选择parent为0且weight最小的两个结点， // 其序号分别为s1和s2。 Select(HT, i-1); 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; printf("\nselect: s1=%d s2=%d\n", s1, s2); printf（" 结点 weight parent lchild rchild"）; for (j=1; j<=i; j++) printf("\n%4d%8d%8d%8d%8d",j,HT[j].weight, HT[j].parent,HT[j].lchild, HT[j].rchild); printf（" 按任意键，继续 。

"）； getchar（)； } //------无栈非递归遍历哈夫曼树，求哈夫曼编码 cd = (char *)malloc(n*sizeof(char)）； // 分配求编码的工作空间 p = m; cdlen = 0; for (i=1; i<=m; ++i) // 遍历哈夫曼树时用作结点状态标志 HT[i].weight = 0; while (p) { if (HT[p].weight==0) { // 向左 HT[p].weight = 1; if (HT[p].lchild != 0) { p = HT[p].lchild; cd[cdlen++] ='0'; } else if (HT[p].rchild == 0) { // 登记叶子结点的字符的编码 HC[p] = (char *)malloc((cdlen+1) * sizeof(char)); cd[cdlen] ='\0'; strcpy(HC[p], cd)； // 复制编码（串） } } else if (HT[p].weight==1) { // 向右 HT[p].weight = 2; if (HT[p].rchild != 0) { p = HT[p].rchild; cd[cdlen++] ='1'; } } else { // HT[p].weight==2，退回退到父结点，编码长度减1 HT[p].weight = 0; p = HT[p].parent; --cdlen; } } } // HuffmanCoding void main() { HuffmanTree HT;HuffmanCode *HC;int *w,n,i; puts（"输入结点数："）； scanf("%d",&n); HC = (HuffmanCode *)malloc(n*sizeof(HuffmanCode)); w = (int *)malloc(n*sizeof(int)); printf（"输入%d个结点的权值\n",n）; for(i = 0;i < n;i++) scanf("%d",&w[i]); HuffmanCoding(HT,HC,w,n); puts("\n各结点的哈夫曼编码：")； for(i = 1;i <= n;i++) printf("%2d(%4d):%s\n",i,w[i-1],HC[i]); getchar(); }。

4.C++课程设计：哈夫曼编码器

#include #include #include #include #include //typedef int TElemType;const int UINT_MAX = 1000;typedef struct{ int weight; int parent, lchild, rchild;} HTNode, *HuffmanTree;typedef char **HuffmanCode;HuffmanTree HT;HuffmanCode HC;int *w, i, j, n;char *z;int flag = 0;int numb = 0;int min(HuffmanTree t, int i){int j, flag; int k = UINT_MAX; for (j = 1; j <= i; j++) if (t[j].weight < k && t[j].parent == 0) k = t[j].weight, flag = j; t[flag].parent = 1; return flag;}void select(HuffmanTree t, int i, int &s1, int &s2){int j; s1 = min(t, i); s2 = min(t, i); if (s1 > s2) { j = s1; s1 = s2; s2 = j; }}void HuffmanCoding(HuffmanTree &HT, HuffmanCode &HC, int *w, int n){int m, i, s1, s2, start; //unsigned c,f; int c, f; HuffmanTree p; char *cd; if (n <= 1) return ;m = 2 * n - 1; HT = (HuffmanTree)malloc((m + 1) *sizeof(HTNode)); for (p = HT + 1, i = 1; i <= n; ++i, ++p, ++w) { p->weight = *w; p->parent = 0; p->lchild = 0; p->rchild = 0; } for (; i <= m; ++i, ++p) p->parent = 0; for (i = n + 1; i <= m; ++i){ select(HT, i - 1, s1, s2); HT[s1].parent = HT[s2].parent = i; HT[i].lchild = s1; HT[i].rchild = s2; HT[i].weight = HT[s1].weight + HT[s2].weight; }HC = (HuffmanCode)malloc((n + 1) *sizeof(char*));cd = (char*)malloc(n *sizeof(char)); cd[n - 1] = '\0'; 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 Initialization(){ flag = 1; int num; int num2; cout << " The initial hoffman linked list " << endl << "Please enter a number of nodes n:"; cin >> num; n = num; w = (int*)malloc(n *sizeof(int)); z = (char*)malloc(n *sizeof(char)); cout << "\n Please please input" << n << "\n Characters (character type) note: must end to enter:" << endl; char base[2]; for (i = 0; i < n; i++) { cout << " The first " << i + 1 << " characters:" << endl; gets(base); *(z + i) = *base; } for (i = 0; i <= n - 1; i++) { cout << setw(6) << *(z + i); } cout << "\n Please please input" << n << " A weights:" << endl; for (i = 0; i <= n - 1; i++) { cout << endl << " The first " << i + 1 << " A character metric:"; cin >> num2; *(w + i) = num2; } HuffmanCoding(HT, HC, w, n);cout << " Characters corresponding coding for:" << endl; for (i = 1; i <= n; i++) { //cout<<" characters "<<*(z+i-1)<<" coding "; puts(HC[i]); }cout << " Below will hoffman code written to the file " << endl << "。

.." << endl; FILE *htmTree; char r[] = { ' ', '\0' }; if ((htmTree = fopen("htmTree.txt", "w")) == NULL) { cout << "can not open file" << endl; return ; } fputs(z, htmTree); for (i = 0; i < n + 1; i++) { fprintf(htmTree, "%6d", *(w + i)); fputs(r, htmTree); } for (i = 1; i <= n; i++) { fputs(HC[i], htmTree); fputs(r, htmTree); } fclose(htmTree); cout << "Characters and corresponding coding has written to the root directory file htmTree.txt中" << endl << endl;}void InputCode(){ //cout<<" Please input your want to code of characters "< n) { cout << " Characters mistake, can't coding!" << endl; break; } } } } } cout << " Coding work" << endl << "Code written to the directory codefile.txt" << endl << endl; fclose(tobetran); fclose(codefile); free(tran);}void Decoding(){ cout << "To root directory file codefile.txt the characters of decode" << endl; FILE *codef, *txtfile; if ((txtfile = fopen("Textfile.txt", "w")) == NULL) { cout << " Cannot open file " << endl; } //txtfile=fopen("Textfile.txt","w"); if ((codef = fopen("codefile.txt", "r")) == NULL) { cout << " Cannot open file " << endl; } //codef=fopen("codefile.txt","r"); char *work, *work2, i2; int i4 = 0, i, i3; unsigned long length = 10000; work = (char*)malloc(length *sizeof(char)); fgets(work, length, codef); work2 = (char*)malloc(length *sizeof(char)); i3 = 2 * n - 1; for (i = 。

5.哈夫曼编码设计源代码

#include<iostream>using namespace std;typedef struct { int weight; int parent; int lchild; int rchild; }HTreeNode,*HTree;void createHTree(HTree *t ,int * w, int n ){ void select(HTree t, int i, int *s1, int *s2); *t = new HTreeNode[2*n-1]; for(int i=0;i<n;i++){ (*t)[i].weight = w[i]; (*t)[i].parent = 0; (*t)[i].lchild = 0; (*t)[i].rchild = 0; } for(int i=n;i<2*n-1;i++){ (*t)[i].weight = 0; (*t)[i].parent = 0; (*t)[i].lchild = 0; (*t)[i].rchild = 0; } int s1,s2; for(int i=n;i<2*n-1;i++){ select (*t, i,&s1,&s2); (*t)[i].weight=(*t)[s1].weight+(*t)[s2].weight; (*t)[i].lchild = s1; (*t)[i].rchild = s2; (*t)[s1].parent = i; (*t)[s2].parent = i; } for(int i=0;i<2*n-1;i++){ printf("%-3d%4d%4d%4d%4d\n",i,(*t)[i].weight,(*t)[i].parent,(*t)[i].lchild,(*t)[i].rchild); }}void select(HTree t, int i, int *s1, int *s2){ for(int j=0;j<i;j++){ if(t[j].parent==0){*s1=j; break;} } for(int j=*s1;j<i;j++){ if( t[j].parent==0 && t[j].weight<t[*s1].weight ){ *s1 = j; } }///////////////////////////////////////// for(int j=0;j<i;j++){ if(t[j].parent==0 && j!=*s1){*s2=j; break;} } for(int j=*s2;j<i;j++){ if(t[j].parent==0 && t[j].weight<t[*s2].weight && j!=*s1){ *s2 = j; } } int temp; if(*s1>*s2){ temp = *s1; *s1= *s2; *s2=temp; }}void encode(HTree t, int n){ int temp,temp2; string s = ""; for(int i = 0 ;i<n;i++){ printf("weight: %-4d",t[i].weight); temp = i; s=""; while(t[temp].parent !=0){ temp2 = temp; temp = t[temp].parent; if(t[temp].lchild == temp2) s.append("0"); if(t[temp].rchild == temp2) s.append("1"); } string::reverse_iterator it = s.rbegin(); while(it != s.rend()){ cout<<*it; it++; } cout<<endl; } }int main(){ int w[8] ={5,29,7,8,14,23,3,11}; int n = 8; HTree t = NULL; createHTree( &t,w,n); cout<<endl; encode(t,n); system("PAUSE"); }。

6.题目：哈夫曼编码系统 设计任务：

#include #include #include #include #include #include using namespace std; struct HuffmanNode //哈夫曼树的一个结点 { int weight; int parent; int lchild,rchild; char sourcecode； //存放源文字符集里的一个字符，如'a' std::string code； //存放字符sourcecode对应的编码 }； class HuffmanTree //哈夫曼树 { private: HuffmanNode *Node; //Node[]存放哈夫曼树 int LeafNum； //哈夫曼树的叶子个数，也是源码个数 public: HuffmanTree(); ~HuffmanTree(); void CreateHuffmanTree(); void (); void (); void Encoder(); void Decoder(); void PrintCodeFile(); void PrintHuffmanTree(); void PrintHuffmanTree_aoru(int T,int layer=1)； }； ////////////////////////////////////////////////////////////////////////////// // 构造函数 // 函数功能：初始化哈夫曼树 //函数参数：无 //参数返回值：无 HuffmanTree::HuffmanTree() { Node=NULL; LeafNum=0； } ////////////////////////////////////////////////////////////////////////////// // 析构函数 // 函数功能：将哈夫曼的数组的空间释放 //函数参数：无 //参数返回值：无 HuffmanTree::~HuffmanTree() { delete[] Node； } ////////////////////////////////////////////////////////////////////////////// // 建立哈夫曼树函数 // 函数功能：建立哈夫曼树（调用键盘建立哈夫曼树或调用从文件建立哈夫曼树的函数） //函数参数：无 //参数返回值：无 void HuffmanTree::CreateHuffmanTree() { char Choose; cout<<"你要从文件中读入哈夫曼树（按1），还是从键盘输入哈夫曼树（按2）?"; cin>>Choose; if(Choose=='2') { //键盘输入建立哈夫曼树 (); }//choose=='2' else { //从哈夫曼树文件hfmTree.dat中读入信息并建立哈夫曼树 （)； } } ////////////////////////////////////////////////////////////////////////////// // 从键盘建立哈夫曼树函数 // 函数功能：从键盘建立哈夫曼树 //函数参数：无 //参数返回值：无 void HuffmanTree::(){ int Num; cout<<"\n请输入源码字符集个数："； cin>>Num; if (Num<=1) { cout<<"无法建立少于2个叶子结点的哈夫曼树。

\n\n"; return; } LeafNum=Num; Node=new HuffmanNode[2*Num-1]; for(int i=0;i>Node[i].weight； //源文的字符权重存入Node[].weight Node[i].parent=-1; Node[i].lchild=-1; Node[i].rchild=-1; Node[i].code="\0"; } for(int j=Num;j<2*Num-1;j++) {//循环建立哈夫曼树内部结点 int pos1,pos2; int max1,max2; pos2=pos1=j; max2=max1=numeric_limits::max（ )； //在所有子树的根结点中，选权重最小的两个根结点，pos1最后应指向权重最小的根结点的下标 //pos2最后应指向权重第二小的根结点的下标 //max1存放当前找到的权重最小的根结点的权重 //max2存放当前找到的权重第二小的根结点的权重 for(int k=j-1;k>=0;k--) { if (Node[k].parent==-1){//如果是某棵子树的根结点 if (Node[k].weight>ch; if (ch!='y'&&ch!='Y') return; ofstream fop; fop.open("hfmTree.dat",ios::out|ios::binary|ios::trunc)； //打开文件 if(fop.fail()) { cout<<"\n哈夫曼树文件打开失败，无法将哈夫曼树写入hfmTree.dat文件。

\n"; return; } fop.write((char*)&Num,sizeof(Num)）； //先写入哈夫曼树的叶子结点个数 for(int n=0;n<2*Num-1;n++) { //最后写入哈夫曼树的各个结点（存储在Node[]中） fop.write((char*)&Node[n],sizeof(Node[n])); flush(cout); } fop.close（)； //关闭文件 cout<<"\n哈夫曼树已成功写入hfmTree.dat文件。\n"； } ////////////////////////////////////////////////////////////////////////////// // 从文件建立哈夫曼树函数 // 函数功能：从文件建立哈夫曼树 //函数参数：无 //参数返回值：无 void HuffmanTree::(){ ifstream fip; fip.open("。

7.哈夫曼编码类的设计并实现包括以下功能

#include#include#include#define N 20#define M 2*N-1char * cd;typedef char *Huffmancode[N+1];typedef struct{ int weight; int parent; int LChild; int RChild; char c;}HTNNOde,HuffmanTree[M+1];void select(HuffmanTree p,int k,int *i,int *j){ int m,n=1; while((n<=k)&&p[n].parent!=0） //寻找双亲节点为空的起始节点 { n++; } m=p[n].weight; *i=n; while(n<=k) //找最小的值 { if(p[n].weight*j) { n=*i; *i=*j; *j=n; }}void creatHuffmanTree(HuffmanTree ht,int w[],int n){ int m=2*n-1,i,s1,s2; for(i=1;i<=n;i++) { ht[i].weight=w[i]; ht[i].parent=0; ht[i].LChild=0; ht[i].RChild=0; } for(i=n+1;i<=m;i++) { ht[i].weight=0; ht[i].parent=0; ht[i].LChild=0; ht[i].RChild=0;// printf("%d\n",ht[i].weight); } for(i=n+1;i<=m;i++) { select(ht,i-1,&s1,&s2); /*ht前i-1项选双亲为零且权最小的两结点*/// printf("%d,%d\n",s1,s2); ht[i].weight=ht[s1].weight+ht [s2].weight; ht[s1].parent=i; ht[s2].parent=i; ht[i].LChild=s1; ht[i].RChild=s2; // printf("%d\n",ht[i].weight); } // i=1; /* while(i<=9) {printf("%d\n",ht[i].weight); i++;} */}void CrtHuffmanCode(HuffmanTree ht,Huffmancode hc,int n,char w[N][20]){ int i,p,c; int start,j=1;// char w[20][20]; cd=(char *)malloc(n*sizeof(char )); cd[n-1]='\0'; for(i=1;i<=n;i++) { start=n-1; c=i; p=ht[i].parent; while ( p!=0) { --start; if(ht[p].LChild == c) cd[start]='0'; else cd[start]='1'; c=p; p=ht[p].parent; } hc[i]=(char *)malloc((n-start)*sizeof(char)); strcpy(hc[i],&cd[start]); strcpy(w[j],hc[i]); j++; printf("%s\n",hc[i])；//实验性打印 }}void translationhuffman(char w[N][20],HuffmanTree ht,int n){ char litter[20];int i;char yes_no; do { printf（"输入哈夫曼编码编码\n"）; scanf("%s",litter); for(i=1;i<=n;i++) if(strcmp(litter,w[i])==0) { printf（"该密码对应的字母\n"）; printf("%c",ht[i].c); break; } if(i==n+1) printf（"无该密码对应字母\n"）; printf(" \n要继续译码吗（Y/N）\n"); do { yes_no=getchar(); }while(yes_no!='Y'&&yes_no!='y'&&yes_no!='N'&&yes_no!='n');}while(yes_no!='N'&&yes_no!='n');}main(){ HuffmanTree ht; Huffmancode hc; int i,n; int h[50];char w[N][20]; printf（"请输入节点总个数"）； scanf("%d",&n); printf（"请输入哈夫曼树权值和对应字母\n"）; for(i=1;i<=n;i++) scanf("%d %c",&h[i],&ht[i].c); creatHuffmanTree(ht,h,n);/* i=1; while(i<=9) {printf("%d\n",ht[i].weight); i++;}*/ CrtHuffmanCode(ht,hc,n,w); translationhuffman(w,ht,n);}。

8.题目：哈夫曼编码系统 设计任务：

#include#include#include#include#include#includeusing namespace std;struct HuffmanNode //哈夫曼树的一个结点{ int weight; int parent; int lchild,rchild; char sourcecode； //存放源文字符集里的一个字符，如'a' std::string code； //存放字符sourcecode对应的编码}；class HuffmanTree //哈夫曼树{private: HuffmanNode *Node; //Node[]存放哈夫曼树 int LeafNum； //哈夫曼树的叶子个数，也是源码个数public: HuffmanTree(); ~HuffmanTree(); void CreateHuffmanTree(); void (); void (); void Encoder(); void Decoder(); void PrintCodeFile(); void PrintHuffmanTree(); void PrintHuffmanTree_aoru(int T,int layer=1)； }；//////////////////////////////////////////////////////////////////////////////// 构造函数// 函数功能：初始化哈夫曼树//函数参数：无//参数返回值：无HuffmanTree::HuffmanTree(){ Node=NULL; LeafNum=0； }//////////////////////////////////////////////////////////////////////////////// 析构函数// 函数功能：将哈夫曼的数组的空间释放//函数参数：无//参数返回值：无HuffmanTree::~HuffmanTree(){ delete[] Node； }//////////////////////////////////////////////////////////////////////////////// 建立哈夫曼树函数// 函数功能：建立哈夫曼树（调用键盘建立哈夫曼树或调用从文件建立哈夫曼树的函数）//函数参数：无//参数返回值：无void HuffmanTree::CreateHuffmanTree() { char Choose; cout<<"你要从文件中读入哈夫曼树（按1），还是从键盘输入哈夫曼树（按2）?"; cin>>Choose; if(Choose=='2') { //键盘输入建立哈夫曼树 (); }//choose=='2' else { //从哈夫曼树文件hfmTree.dat中读入信息并建立哈夫曼树 （)； }}//////////////////////////////////////////////////////////////////////////////// 从键盘建立哈夫曼树函数// 函数功能：从键盘建立哈夫曼树//函数参数：无//参数返回值：无void HuffmanTree::(){ int Num; cout<<"\n请输入源码字符集个数："； cin>>Num; if (Num<=1) { cout<<"无法建立少于2个叶子结点的哈夫曼树。

\n\n"; return; } LeafNum=Num; Node=new HuffmanNode[2*Num-1]; for(int i=0;i>Node[i].weight； //源文的字符权重存入Node[].weight Node[i].parent=-1; Node[i].lchild=-1; Node[i].rchild=-1; Node[i].code="\0"; }for(int j=Num;j<2*Num-1;j++) {//循环建立哈夫曼树内部结点 int pos1,pos2; int max1,max2; pos2=pos1=j; max2=max1=numeric_limits::max（ )； //在所有子树的根结点中，选权重最小的两个根结点，pos1最后应指向权重最小的根结点的下标 //pos2最后应指向权重第二小的根结点的下标 //max1存放当前找到的权重最小的根结点的权重 //max2存放当前找到的权重第二小的根结点的权重for(int k=j-1;k>=0;k--) { if (Node[k].parent==-1){//如果是某棵子树的根结点 if (Node[k].weight>ch; if (ch!='y'&&ch!='Y') return; ofstream fop; fop.open("hfmTree.dat",ios::out|ios::binary|ios::trunc)； //打开文件 if(fop.fail()) { cout<<"\n哈夫曼树文件打开失败，无法将哈夫曼树写入hfmTree.dat文件。

\n"; return; } fop.write((char*)&Num,sizeof(Num)）； //先写入哈夫曼树的叶子结点个数 for(int n=0;n<2*Num-1;n++) { //最后写入哈夫曼树的各个结点（存储在Node[]中） fop.write((char*)&Node[n],sizeof(Node[n])); flush(cout); } fop.close（)； //关闭文件 cout<<"\n哈夫曼树已成功写入hfmTree.dat文件。\n"；}//////////////////////////////////////////////////////////////////////////////// 从文件建立哈夫曼树函数// 函数功能：从文件建立哈夫曼树//函数参数：无//参数返回值：无void HuffmanTree::(){ ifstream fip; fip.open("hfmTree.dat",ios::binary|ios::in); if(fip.fail()) { cout<<。

9.哈夫曼编码设计源代码

#include using namespace std; typedef struct { int weight; int parent; int lchild; int rchild; }HTreeNode,*HTree; void createHTree(HTree *t ,int * w, int n ){ void select(HTree t, int i, int *s1, int *s2); *t = new HTreeNode[2*n-1]; for(int i=0;i*s2){ temp = *s1; *s1= *s2; *s2=temp; } } void encode(HTree t, int n){ int temp,temp2; string s = ""; for(int i = 0 ;i

转载请注明出处众文网 » 哈夫曼编码毕业论文