运用哈夫曼编码压缩解压文件源代码.docVIP

运用哈夫曼编码压缩解压文件源代码 2010-06-22 11:25 #include iostream#include fstream#include string#include cmath#include iomanipusing namespace std;struct head{unsigned char b;???????? //记录字符long count;?????????? //权重int parent,lch,rch;???????? //定义双亲，左孩子，右孩子char bits[256];????????? //存放哈夫曼编码的数组}header[512],tmp;????????? //头部一要定设置至少512个,因为结点最多可达256,所有结点数最多可达511 unsigned char ctoa(char a[])?????????? /*将数组的前八位转成二进制形式比特位*/{unsigned char c=0;for(int i=0;i8;i++)?? if(a[i]!=0)?? {??? c=c+(int)(a[i]-0)*pow(2,8-1-i);?? }return c;} char *code(unsigned char temp,int leafnum)????? //寻找对应字符的编码串，并返回{for(int i=0;ileafnum;i++)?? if(temp==header[i].b)??? return header[i].bits;return NULL;}void compress(char *infilename,char *outfilename){long flength=0;???????????????????????????????????????????????? //记录压缩前文件长度long clength=8;????????????? //编码从偏移量8记录，统计压缩后编码长度加8int leafnum;????????????? //定义叶子结点int pointnum;????????????? //定义总结点unsigned char temp;???????????? //定义unsigned char类型，暂存文件中字符的中间变量/*********************************文件中字符频度************************************/ for(int i=0;i256;i++){?? header[i].count=0;??????????? //初始化权重?? header[i].b=(unsigned char)i;???????? //初始化字符}ifstream infile(infilename,ios::in|ios::binary);while(infile.peek()!=EOF){?? infile.read((char *)temp,sizeof(unsigned char));??? //读入一个字符?? header[temp].count++;????????? //统计对应结点字符权重?? flength++;????????????? //统计文件长度}infile.close();????????????? //关闭文件for(i=0;i256-1;i++)??????????? //对结点进行冒泡排序,权重大的放在上面，编码时效率高?? for(int j=0;j256-1-i;j++)??? if(header[j].countheader[j+1].count)??? {???? tmp=header[j];???? header[j]=header[j+1];???? header[j+1]=tmp;??? }for(i=0;i256;i++)?? if(header[i].count==0) break;leafnum=i;????????????? //取得哈夫曼树中叶子结点数pointnum=2*leafnum-1;?????????? //取得哈夫曼树中总结点数目 /**********************************根据频度建树*************************************/ long min;?????????????? //尽量用long，如果文件过大，这里建树可能不是最优树了int s1,s2;for(i=leafnum;ipointnum;i++)?????????