huffman编码

#include<bits/stdc++.h>
using namespace std;
typedef struct
{
    int weight;
    int parent,left,right;
}HTNode,*HuffmanTree;
typedef char **HuffmanCode;
const int Max=0x3f3f3f;
void Select(HuffmanTree HT,int len,int &s1,int &s2)
{//在构造赫夫曼树HT时，序号小的权值放在左边，不是权值小的放左边！
    int min1=Max,min2=Max,f=1;
    s1=s2=0;
    for(int i=1;i<=len;i++)
    {
        if(HT[i].parent==0&&f==1)
        {
            min1=HT[i].weight;
            s1=i;
            f=0;
        }
        else
        {
            if(HT[i].weight<min1&&HT[i].parent==0)
            {
                min1=HT[i].weight;
                s1=i;
            }
        }
    }
    for(int i=1;i<=len;i++)
    {
        if(i!=s1)
        {
            if(HT[i].weight<min2&&HT[i].parent==0)
            {
                min2=HT[i].weight;
                s2=i;
            }
        }
    }
    if(s1>s2) swap(s1,s2);
    //下面是权值小的放在左边
    /*int min1=Max,min2=Max;
    for(int i=1;i<=len;i++)
    {
        if(HT[i].weight<min1&&HT[i].parent==0)
        {
            min1=HT[i].weight;
            s1=i;
        }
    }
    int temp=HT[s1].weight;
    HT[s1].weight=Max;
    for(int i=1;i<=len;i++)
    {
        if(HT[i].weight<min2&&HT[i].parent==0)
        {
            min2=HT[i].weight;
            s2=i;
        }
    }
    HT[s1].weight=temp;*/
}
void CreatHuffmanTree(HuffmanTree &HT,int n)
{
    int m,s1,s2;
    if(n<=1) return;
    m=2*n-1;
    HT=new HTNode[m+1];
    for(int i=1;i<=m;i++)
    {
        HT[i].parent=0;
        HT[i].left=0;
        HT[i].right=0;
    }
    for(int i=1;i<=n;i++) scanf("%d",&HT[i].weight);
    for(int i=n+1;i<=m;i++)//通过n-1次的选择、删除、合并来构建赫夫曼树
    {
        Select(HT,i-1,s1,s2);//在HT[k](1<=k<=i-1)中选择两个双亲域为0且"权值最小"的结点
        //并返回它们在HT中的序号
        HT[s1].parent=i;//得到新结点i,从森林中删除s1,s2,将s1和s2双亲域由改为i
        HT[s2].parent=i;
        HT[i].left=s1;//s1,s2分别作为i的左右孩子
        HT[i].right=s2;
        HT[i].weight=HT[s1].weight+HT[s2].weight;//i的权值为左右孩子权值之和
    }
}
void CreatHuffmanCode(HuffmanTree HT,HuffmanCode &HC,int n)
{
    //从叶子到根逆向求每个字符的赫夫曼编码,存储在赫夫曼编码
    int i,start,c,f;
    HC=new char*[n+1];
    char *cd=new char[n];
    cd[n-1]=0;
    for(int i=1;i<=n;i++)
    {
        start=n-1;//start开始时指向最后，即编码结束符位置
        c=i;
        f=HT[i].parent;//f指向结点c的双亲结点
        while(f)//从叶子结点开始向上回溯，直到根结点
        {
            start--;//回溯一次start向前指一个位置
            if(HT[f].left==c) cd[start]='0';
            else cd[start]='1';
            c=f;
            f=HT[f].parent;
        }
        HC[i]=new char[n-start];
        strcpy(HC[i],&cd[start]);
    }
    delete cd;
}
void show(HuffmanTree HT,HuffmanCode &HC,int n)
{
    for(int i=1;i<=n;i++) printf("%s\n",HC[i]);
}
int main()
{
    HuffmanTree HT;
    HuffmanCode HC;
    int n;
    while(~scanf("%d",&n))
    {
        CreatHuffmanTree(HT,n);
        CreatHuffmanCode(HT,HC,n);
        show(HT,HC,n);
    }
    return 0;
}