哈夫曼树,第一行输入一个数n,表示叶结点的个数。
需要用这些叶结点生成哈夫曼树,根据哈夫曼树的概念,这些结点有权值,即weight,题目需要输出哈夫曼树的带权路径长度(WPL)。
#include <queue>
#include <iostream>
using namespace std;
int main()
{
priority_queue <int , vector<int> , greater<int>> q;
int n;
cin >> n;
int res = 0;
for (int i = 0 ; i < n ; i ++)
{
int x;
cin >> x;
q.push(x);
}
int a , b;
while (q.size())
{
a = q.top();
q.pop();
if (!q.size()) break;
b = q.top();
q.pop();
q.push(a + b);
res += a + b;
}
cout << res << endl;
return 0;
}
本题要求字符的哈夫曼编码,注意建立的哈夫曼树严格按照左小右次小的顺序,并且哈夫曼编码时严格按照左‘0’右‘1’进行编码。
输入格式:
输入是各个字符在通信中出现的频率
输出格式:
输出是各个字符的哈夫曼编码,每个字母占一行
#include <queue>
#include <iostream>
#include <cstring>
#include <vector>
using namespace std;
const int N = 10010;
int son[N][2];
int num[N];
bool st[N];
vector<int> code[N];
void dfs(int j)
{
if (!son[j][0] && !son[j][1])
return;
if (son[j][0])
{
code[son[j][0]] = code[j];
code[son[j][0]].push_back(0);
dfs(son[j][0]);
}
if (son[j][1])
{
code[son[j][1]] = code[j];
code[son[j][1]].push_back(1);
dfs(son[j][1]);
}
}
int main()
{
memset(son , 0 , sizeof son);
priority_queue<int , vector<int> , greater<int>> q;
for (int i = 0 ; i < 8 ; i ++)
{
char c;
scanf("%c" , & c);
getchar();
scanf("%d" , &num[i]);
getchar();
cout << num[i] << " ";
q.push(num[i]);
}
while (q.size() > 1)
{
int a = q.top();
q.pop();
int b = q.top();
q.pop();
int sum = a + b;
q.push(sum);
if (a < b)
{
son[sum][0] = a;
son[sum][1] = b;
}
else
{
swap(b , a);
}
son[sum][0] = a;
son[sum][1] = b;
code[a].push_back(0);
code[b].push_back(1);
dfs(sum);
}
for (int i = 0 ; i < 8 ; i ++)
{
cout << (char)('A' + i) << ":";
for (int j = code[num[i]].size() - 1 ; j >= 0 ; j --) cout << code[num[i]][j];
cout << endl;
}
return 0;
}