哈夫曼算法压缩和解压字符串.docVIP

2010-12-02 22:39 [原]文件编码2用哈夫曼算法压缩和解压字符串 #include stdio.h#include stdlib.h#include string.h//char * chrs = At the highest level of abstraction, there are three basic drawing operations: clearing the window, drawing a geometric object, and drawing a raster object. Raster objects, which include such things as two-dimensional images, bitmaps, and character fonts, are covered in Chapter 8 . In this chapter, you learn how to clear the screen and to draw geometric objects, including points, straight lines, and flat polygons. \0;//char * chrs = kgasdgalfjsladd\0;char * chrs = fsskffffaavbbbcscscscs\0;int asciiCharsCount[128];char currlCodeChrs[9];int charCountSize = 0;long totalUrlLength = 0;long totalUrlOffset = 0;int currlMinValueIndex = -1;//当前最小值的索引char * resultBinString; //二进制字符串long binStringIndex = 0; //二进制字符索引char * resultBytes; //编码后的字节int resultByteSize = 0; //编码后字节的数量typedef struct treeNode { //树节点??? char nodename; //代表的字符??? int nodeFlag; //1:叶节点,0:根节点??? int weight; //权值,字符的频率??? char * url; //路径??? } TreeNode;//==================================================void initCharCount(){??? int i=0;??? memset(asciiCharsCount,0,sizeof(asciiCharsCount));??? for(i=0;i(int)(strlen(chrs));i++){??? ??? int curlChar = (int)(chrs[i]);??? ??? asciiCharsCount[curlChar] = asciiCharsCount[curlChar] + 1;??? }}int getMinValue(){ //查找数量大于0,并且最小的索引??? int relIndex = -1;??? int minValue = (int)(strlen(chrs));??? int i=0;??? for(i=0;i128;i++){??? ??? if(asciiCharsCount[i] 0){??? ??? ??? if(minValue asciiCharsCount[i]){??? ??? ??? ??? minValue = asciiCharsCount[i];??? ??? ??? ??? relIndex = i;??? ??? ??? }??? ??? }??? }??? return relIndex;}void binChrsToByte(){??? int i=0;??? char hChrs[5];??? char lChrs[5];??? ??? int resultValue = 0x00;??? char bTable[65] = 0000000100100011010001010110011110001001101010111100110111101111\0;??? for(i=0;i4;i++){??? ??? hChrs[i] = currlCodeChrs[i];??? ??? lChrs[i] = currlCodeChrs[i+4]