哈夫曼编码基本练习

最新推荐文章于 2023-12-30 14:29:39 发布

Aolish

最新推荐文章于 2023-12-30 14:29:39 发布

阅读量1.2k

点赞数 1

分类专栏：算法练习文章标签：算法练习

本文链接：https://blog.csdn.net/Aolish/article/details/53729649

版权

算法练习专栏收录该内容

2 篇文章 0 订阅

订阅专栏

哈夫曼编码

#include<stdio.h>
#include<iostream>
#define MAX_WEIGHT 666
using namespace std;
int MAX = MAX_WEIGHT;
int s1 = 1,s2 = 1;

typedef struct {
    int weight;
    int number;
    int parent,lchild,rchild;
}HTNode,*HuffmanTree;


void Select(HuffmanTree &HT, int n , int *i,int *j){

    int l1 = MAX,l2 = MAX;
    for (int k = 1; k <=n; ++k) {
        if (HT[k].parent == 0 ) {
            if(HT[k].weight<l1){
                l1 = HT[k].weight;
                *i = k;
            } else if (HT[k].weight<l2){
                l2 = HT[k].weight;
                *j = k;
            }
        }
    }

}
void creatHuffmanCode(HuffmanTree &HT, int n){//create HuffmanTree
    if (n<1) return;
    int m = 2*n-1;
    HT = new HTNode[m+1];
    for (int i = 1; i <= m; ++i) {//inital data
        HT[i].parent = 0;
        HT[i].lchild = 0 ;
        HT[i].rchild = 0;
    }
    printf("Please enter the weight :\n");
    for (int i = 1; i <= n; ++i) {//input weight
        cin>>HT[i].weight;
    }
    for (int i = n+1; i <= m; ++i) {
        Select(HT,i - 1,&s1,&s2);
        HT[s1].parent = i;HT[s2].parent = i;
        HT[i].lchild = s1;HT[i].rchild=s2;
        HT[i].weight = HT[s1].weight + HT[s2].weight;
    }
}
int main(){
    int n;
    HuffmanTree root = NULL;
    printf("Please enter the node number:\n");
    scanf("%d",&n);
    creatHuffmanCode(root,n);
    printf("\n  number      weight     parent    lchild     rchild");
    for(int i=1;i<=2*n-1;i++)
    {
        printf("\n");
        printf("  %d   %10d  %10d %10d%10d",i,root[i].weight, root[i].parent,root[i].lchild,root[i].rchild);
    }
    return 0;

}