哈哈哈哈哈哈哈哈哈哈哈哈哈哈哈哈夫曼树

jtss123

已于 2024-04-26 20:06:09 修改

阅读量231

点赞数 2

分类专栏：数据结构学习文章标签：算法 c++ 数据结构

于 2024-04-26 20:05:54 首次发布

本文链接：https://blog.csdn.net/jtss123/article/details/138229036

版权

数据结构学习专栏收录该内容

16 篇文章 1 订阅

订阅专栏

文章介绍了如何在C++中使用结构体定义二叉树（Node和MIN），实现节点选择、树的构建函数createTr、以及字符和数字之间的转换函数changetochar和changetonumber。还展示了main函数中的关键操作，如处理输入数据和打印结果。

摘要由CSDN通过智能技术生成

#include <bits/stdc++.h>
using namespace std;
typedef struct Node
{
    int l, r, parent;
    char data;
    int weight;
    string num;
} *Tr, N;
typedef struct MIN
{
    int s1, s2;
} MIN, Min;
MIN select(Tr huf, int num)
{
    int s1, s2;
    s1 = s2 = 1;
    int min1, min2;
    min1 = 100000, min2 = 100000;
    for (int i = 1; i <= num; i++)
    {
        if (huf[i].parent == 0 && huf[i].weight < min1)
        {
            min1 = huf[i].weight;
            s1 = i;
        }
    }
    for (int i = 1; i <= num; i++)
    {
        if (i != s1 && huf[i].parent == 0 && huf[i].weight < min2)
        {
            min2 = huf[i].weight;
            s2 = i;
        }
    }
    MIN ans;
    ans.s1 = s1;
    ans.s2 = s2;
    return ans;
}
void number(Tr &Huf, int num)
{
    for (int i = num; i >= 1; i--)
    {
        if (Huf[Huf[i].parent].parent)
        {
            Huf[i].num = Huf[Huf[i].parent].num + Huf[i].num;
        }
    }
}
void createTr(Tr &Huf, int num)
{
    int m = 2 * num;
    m -= 1;
    Huf = new Node[m + 1];
    for (int i = 1; i <= m; i++)
    {
        Huf[i].parent = Huf[i].l = Huf[i].r = 0;
    }
    for (int i = 1; i <= num; i++)
    {
        cin >> Huf[i].weight;
    }
    for (int i = 1; i <= num; i++)
    {
        Huf[i].data = 'a' + i - 1;
    }
    for (int i = num + 1; i <= m; i++)
    {
        Min temp;
        temp = select(Huf, i - 1);
        int s1 = temp.s1;
        int s2 = temp.s2;
        Huf[s1].parent = i;
        Huf[s2].parent = i;
        Huf[s1].num = "0";
        Huf[s2].num = "1";
        //     cout << s1 << " " << s2 << endl;
        Huf[i].l = temp.s1;
        Huf[i].r = temp.s2;
        Huf[i].weight = Huf[s1].weight + Huf[s2].weight;
        Huf[i].data = -1;
    }
    number(Huf, m);
}
string changetochar(Tr Huf, string s, int m)
{
    string ans;
    int pos = 0, first = 0;
    while (first < s.size())
    {

        pos++;
        for (int i = 1; i <= m; i++)
        {
            if (Huf[i].num == s.substr(first, pos))
            {
                cout << Huf[i].data;
                first = first + pos;
                pos = 0;
            }
        }
    }
}
void changetonumber(Tr Huf, string s, int num)
{
    string ans;
    for (int i = 0; i < s.size(); i++)
    {
        for (int j = 1; j <= num; j++)
        {
            if (Huf[j].data == s[i])
            {
                ans = ans + Huf[j].num;
            }
        }
    }
    cout << ans;
    return;
}
void prt(Tr Huf, int num)
{
    for (int i = 1; i <= num; i++)
    {
        cout << Huf[i].num << endl;
    }
}
int main()
{
    int num;
    cin >> num;
    Tr Huf;
    createTr(Huf, num);
    string a, b;
    cin >> a;
    cin >> b;
    prt(Huf, num);
    //  cout << a << " " << b;
    changetonumber(Huf, a, num);
    cout << endl;
    changetochar(Huf, b, num);
} /*
8
5 29 7 8 14 23 3 11
aabchg
00011110111111001
 */

被折磨了好久，错误点1 select(Huf,i-1) 错误点2 huf[i].parent==0