赫夫曼编码C语言实现

最新推荐文章于 2024-02-21 21:56:10 发布

duxingzhe103

最新推荐文章于 2024-02-21 21:56:10 发布

阅读量2.3k

点赞数

CC 4.0 BY-SA版权

分类专栏： C/C++

本文链接：https://blog.youkuaiyun.com/myfather103/article/details/53785945

本文介绍了如何使用C语言来实现赫夫曼编码，主要关注小根堆的处理技巧，探讨了在优化编码效率方面的策略。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#include <stdio.h>

#define MAXBIT 100
#define MAXVALUE 10000
#define MAXLEAF 30
#define MAXNODE MAXLEAF*2-1

typedef struct
{
    int bit[MAXBIT];
    int start;
}HCodeType;

typedef struct
{
    int weight;
    int parent;
    int lchild;
    int rchild;
}HNodeType;

void HuffmanTree(HNodeType HuffNode[MAXNODE], int n)
{
    int i, j, m1, m2, x1, x2;
    for (i = 0; i < 2 * n - 1; i++)
    {
        HuffNode[i].weight = 0;
        HuffNode[i].parent = -1;
        HuffNode[i].lchild = -1;
        HuffNode[i].rchild = -1;
    }

    for (i = 0; i < n; i++)
    {
        printf("Please input weight of leaf node %d: \n", i);
        scanf("%d", &HuffNode[i].weight);
    }

    for (i = 0; i < n - 1; i++)
    {
        m1 = m2 = MAXVALUE;
        x1 = x2 = 0;
        for (j = 0; j < n + i; j++)
        {
            if (HuffNode[j].weight < m1&&HuffNode[j].parent == -1)
            {
                m2 = m1;
                x2 = x1;