最优前缀码

最优前缀码

1.问题

2.解析

3.设计

核心代码实现：

void HuffmanTree(int n){
    int a,b,c,d;
    for (int i=0;i<n*2-1;++i){
        huffman[i].weight=0;
        huffman[i].parent=-1;
        huffman[i].leftchild=-1;
        huffman[i].rightchild=-1;
    }
    for (int i=0;i<n;i++){
        printf("输入第%d个哈夫曼字符和权重:\n",i+1);
        cin >> huffman[i].ch;
        scanf("%d",&huffman[i].weight);
    }
    for (int i=0;i<n-1;i++){
        a=b=-1;
        c=d=10000;
        for (int j=0;j<n+i;j++){
            if (huffman[j].parent==-1 && huffman[j].weight<c){
                d=c;
                b=a;
                a=j;
                c=huffman[j].weight;
            }
            else if (huffman[j].parent==-1 && huffman[j].weight<d){
                b=j;
                d=huffman[j].weight;
            }
        }
        huffman[n+i].leftchild=a;
        huffman[n+i].rightchild=b;
        huffman[n+i].weight=c+d;
        huffman[a].parent=n+i;
        huffman[b].parent=n+i;
    }
}

4.分析

时间复杂度：O(nlogn)