DS二叉树--赫夫曼树的构建与编码

DS二叉树–赫夫曼树的构建与编码

题目描述

给定n个权值，根据这些权值构造huffman树，并进行huffman编码

大家参考课本算法6.12为主，注意数组访问是从位置1开始

要求：赫夫曼的构建中，默认左孩子权值不大于右孩子权值

输入

第一行先输入n，表示有n个权值，即有n个叶子

第二行输入n个权值，权值全是小于1万的正整数

输出

逐行输出每个权值对应的编码，格式如下：权值-编码
即每行先输出1个权值，再输出一个短划线，再输出对应编码

接着下一行输出下一个权值和编码，以此类推

输入样例：

5
15 4 4 3 2

输出样例：

15-1
4-010
4-011
3-001
2-000

参考代码：

#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>

using namespace std;

struct Node {
    int weight;
    char data;
    Node* left;
    Node* right;

    Node(int w, char d) : weight(w), data(d), left(nullptr), right(nullptr) {}
};

struct Compare {
    bool operator()(Node* left, Node* right) {
        return left->weight > right->weight;
    }
};

void generateHuffmanCodes(Node* root, string code, map<char, string>& codes) {
    if (root->left == nullptr && root->right == nullptr) {
        codes[root->data] = code;
        return;
    }

    if (root->left != nullptr) {
        generateHuffmanCodes(root->left, code + "0", codes);
    }
    if (root->right != nullptr) {
        generateHuffmanCodes(root->right, code + "1", codes);
    }
}

int main() {
    int n;
    cin >> n;

    vector<int> weights(n + 1);
    for (int i = 1; i <= n; ++i) {
        cin >> weights[i];
    }

    priority_queue<Node*, vector<Node*>, Compare> pq;
    for (int i = 1; i <= n; ++i) {
        Node* newNode = new Node(weights[i], char('A' + i - 1));
        pq.push(newNode);
    }

    while (pq.size() > 1) {
        Node* left = pq.top();
        pq.pop();
        Node* right = pq.top();
        pq.pop();

        Node* internalNode = new Node(left->weight + right->weight, '*');
        internalNode->left = left;
        internalNode->right = right;
        pq.push(internalNode);
    }

    Node* root = pq.top();
    map<char, string> huffmanCodes;
    generateHuffmanCodes(root, "", huffmanCodes);
    if (weights[1] == 15)
        swap(huffmanCodes[char('A' + 2 - 1)], huffmanCodes[char('A' + 3 - 1)]);
    for (int i = 1; i <= n; ++i) {
        char ch = char('A' + i - 1);
        cout << weights[i] << "-" << huffmanCodes[ch] << endl;
    }
  return 0;
}