Huffman编码

最新推荐文章于 2020-10-14 14:41:00 发布

zcx_language

最新推荐文章于 2020-10-14 14:41:00 发布

阅读量144

点赞数

分类专栏： Basic Algorithm

本文链接：https://blog.csdn.net/language_zcx/article/details/79501276

版权

Basic Algorithm 专栏收录该内容

5 篇文章 0 订阅

订阅专栏

#include <iostream>
#include <string>
#include <vector>
#include<algorithm>
using namespace std;
class Huffman {
public:
    char elementChar;//节点元素
    int weight;//权重
    char s;//哈夫曼编码
    Huffman* parent;//父节点
    Huffman* leftChild;//左孩子
    Huffman* rightChild;//右孩子
public:
    Huffman();
};
Huffman::Huffman() {
    this->s = ' ';
    this->elementChar = '*';//非叶子节点
    this->parent = this->leftChild = this->rightChild = NULL;
}
bool cmp(Huffman *a,Huffman *b) {
    return a->weight < b->weight;
}
//递归输出哈夫曼值
void huffmanCode(Huffman *h) {
    if(h->leftChild == NULL && h->rightChild == NULL) {
        string s;
        Huffman *temp = h;
        while(temp->parent!= NULL) {
            s = temp->s + s;
            temp = temp->parent;
        }
        cout << h->elementChar << "的哈夫曼编码是：" << s << endl;
        return;
    }
    huffmanCode(h->leftChild);
    huffmanCode(h->rightChild);
}
int main() {
    string huffmanStr;
    cout << "请输入一串字符序列：" << endl;
    cin >> huffmanStr;
    //得到字符串信息
    int i=0,j,n,m[100],h,k=0;
    char cha[100];
    n = huffmanStr.length();
    cout << "字符串总共有字符" << n << "个" << endl;
    for(int i = 0; i < n; i++) {
        j = 0;
        h = 0;
        while(huffmanStr[i] != huffmanStr[j])
            j++;
        if(j == i) { //第一次出现的字符
            cha[k] = huffmanStr[i];
            cout << "字符" << cha[k] << "出现";
        }
        //如果j !=i 则表示该字符已被统计过，略过此次循环
        else
            continue;
        for(j = i; j < n; j++) {
            if(huffmanStr[i] == huffmanStr[j])
                h++;
        }
        cout << h << "次" << endl;
        m[k] = h;
        k++;
    }//得到不同的字符数为k
    vector < Huffman *> huffmanQueue;
    for(int i = 0; i < k; i++) {
        Huffman *huffmanTemp=new Huffman();
        huffmanTemp->elementChar = cha[i];//字符
        huffmanTemp->weight = m[i];//权重
        huffmanQueue.push_back(huffmanTemp);//塞入队列
    }
    //得到哈夫曼树所有节点
    int huffmanQueue_index = 0;
    sort(huffmanQueue.begin(), huffmanQueue.end(),cmp);//队列排序
    while(huffmanQueue.size() < 2 * k - 1) { //把合并后的结点都算上 完全二叉树节点数=2*叶子结点数-1
        Huffman *huffmanTemp=new Huffman();
        huffmanTemp->weight = huffmanQueue[huffmanQueue_index]->weight + huffmanQueue[huffmanQueue_index + 1]->weight;//合成最小两个节点的父节点
        huffmanTemp->leftChild = huffmanQueue[huffmanQueue_index];
        huffmanTemp->rightChild = huffmanQueue[huffmanQueue_index+1];
        huffmanQueue[huffmanQueue_index]->parent = huffmanQueue[huffmanQueue_index+1]->parent = huffmanTemp;
        huffmanQueue[huffmanQueue_index]->s = '0';//左子结点给最小
        huffmanQueue[huffmanQueue_index + 1]->s = '1';//右子结点给次小
        huffmanQueue.push_back(huffmanTemp);//将父节点加入队列
        huffmanTemp->elementChar = '*';//非叶子结点
        sort(huffmanQueue.begin(), huffmanQueue.end(),cmp);//重新排序
        huffmanQueue_index += 2;//越过已组合完结的最小和次小结点
    }
    Huffman *huffmanTemp;
    huffmanTemp = huffmanQueue.back();
    huffmanCode(huffmanTemp);
    return 0;
}