问题 B: 算法6-13:自顶向下的赫夫曼编码
时间限制: 1 Sec 内存限制: 32 MB
献花: 11 解决: 9
[献花][花圈][TK题库]
题目描述
在本题中,我们将要讨论的是自顶向下的赫夫曼编码算法。从根出发,遍历整棵赫夫曼树从而求得各个叶子结点所表示的字符串。算法的关键部分可以表示如下:
在本题中,读入n个字符所对应的权值,生成赫夫曼编码,并依次输出计算出的每一个赫夫曼编码。
输入
输入的第一行包含一个正整数n,表示共有n个字符需要编码。其中n不超过100。
第二行中有n个用空格隔开的正整数,分别表示n个字符的权值。
输出
共n行,每行一个字符串,表示对应字符的赫夫曼编码。
样例输入
8
5 29 7 8 14 23 3 11
样例输出
0110
10
1110
1111
110
00
0111
010
提示
在本题中,与上一题不同的是在求赫夫曼编码的过程中,使用了从根出发开始遍历整棵赫夫曼树的自顶向下的算法。通过这两道题目的联系,应该能够熟练的掌握赫夫曼树和赫夫曼编码的构造和使用方法了。
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <iostream>
#include <queue>
#include <cfloat>
#include <cstring>
using namespace std;
const int MaxN = 110;
int w[MaxN];
typedef struct
{
int weight;
int parent, lchild, rchild;
}HuffmanNode, *HuffmanTree;
typedef char *HuffmanCode;
void seletTMin(HuffmanTree HT, int n, int &m1, int &m2)
{
int min = INT32_MAX;
for (int i = 1; i <= n; ++i)
{
if (HT[i].parent == 0 && min > HT[i].weight)
{
min = HT[i].weight;
m1 = i;
}
}
min = INT32_MAX;
for (int i = 1; i <= n; ++i)
{
if (HT[i].parent == 0 && min > HT[i].weight && i != m1)
{
min = HT[i].weight;
m2 = i;
}
}
if (m1 > m2)
swap(m1, m2);
}
void HuffmanCoding(HuffmanTree &HT, HuffmanCode *&HC,int w[], int n)
{
if (n <= 1) return;
int m = 2 * n - 1;
HT = new HuffmanNode[m + 1];
for (int i = 1; i <= n; ++i)
{
HT[i].weight = w[i];
HT[i].lchild = HT[i].rchild = HT[i].parent = 0;
}
for (int i = n + 1; i <= m; ++i)
HT[i].lchild = HT[i].rchild = HT[i].parent = 0;
for (int i = n + 1; i <= m; ++i)
{
int m1, m2;
seletTMin(HT, i - 1, m1, m2);
HT[i].lchild = m1;
HT[i].rchild = m2;
HT[m1].parent = HT[m2].parent = i;
HT[i].weight = HT[m1].weight + HT[m2].weight;
}
HC = new HuffmanCode[n + 1];
char * cd = new char[n];
cd[n - 1] = 0;
int c = m,cdlen = 0;
for (int i = 1; i <= m; ++i)
HT[i].weight = 0;
while (c)
{
if (HT[c].weight == 0)
{
HT[c].weight = 1;
if (HT[c].lchild != 0)
{
c = HT[c].lchild;
cd[cdlen++] = '0';
}
else if (HT[c].lchild == 0)
{
cd[cdlen] = 0;
HC[c] = new char[cdlen];
strcpy(HC[c], cd);
}
}
else if (HT[c].weight == 1)
{
HT[c].weight = 2;
if (HT[c].rchild != 0)
{
cd[cdlen++] = '1';
c = HT[c].rchild;
}
}
else
{
HT[c].weight = 0;
c = HT[c].parent;
--cdlen;
}
}
delete cd;
}
int main()
{
#ifdef _DEBUG
freopen("data.txt", "r+", stdin);
#endif // _DEBUG
std::ios::sync_with_stdio(false);
HuffmanTree HT;
HuffmanCode *HC;
int n;
int data[MaxN];
while (cin >> n)
{
for (int i = 1; i <= n; ++i)
cin >> data[i];
HuffmanCoding(HT, HC, data, n);
for (int i = 1; i <= n; ++i)
cout << HC[i] << endl;
delete HC;
delete HT;
}
return 0;
}
/**************************************************************
Problem: 1761
User: Sharwen
Language: C++
Result: 升仙
Time:2 ms
Memory:1700 kb
****************************************************************/