C++ Huffman编码压缩解压

压缩：统计词频--->建立Huffman树--->保存词频--->逐个字节转换为编码写入

解压：读取词频--->建立Huffman树---->读取编码重走Huffman树返回对应字符

#include <iostream>
#include <string>
#include <cstdlib>
#include <cstring>
#include <cstdio>
#include <bitset>
#include <ctime>
#define OK 1
using namespace std;
using std::bitset;
FILE* outputfile;
FILE* inputfile;
typedef int Status;
char Func[3][15] = {"compress","decompression","help"};
typedef struct{ //Huffman树结点定义：HTNode,*HuffmanTree
    unsigned long long weight;
    unsigned int parent,lchild,rchild;
}HTNode,*HuffmanTree;
typedef char ** HuffmanCode;//动态分配数组储存Huffman编码表
Status Select(HuffmanTree HT,int range,int &min1,int &min2){//在HT[1,...,range]选择parent为0且weight最小的两个结点，其序号分别为min1与min2
    int i;
    unsigned long long min1w,min2w;
    min2w = min1w = 1844674407370955161;
    for(i = 1;i <= range;i++){
        if(!HT[i].parent){
            if(HT[i].weight < min1w) {min2=min1;min2w = min1w;min1 = i;min1w = HT[i].weight;}
            else if(HT[i].weight < min2w && i != min1) {min2 = i;min2w = HT[i].weight;}
        }//if
    }//for
    return OK;
}//Select
Status HuffmanCoding(HuffmanTree &HT,HuffmanCode &HC,unsigned long long * weight,int N){    //根据weight生成N叶子结点Huffman树并将Huffman编码保存在HC中
    if(N <= 1)  return OK;
    int m = 2 * N - 1,i;
    HT = (HuffmanTree)malloc((m + 1)*sizeof(HTNode));