哈夫曼编码

#include <bits/stdc++.h>

using namespace std;

const int inf = 0x3f3f3f3f;

typedef struct {
	char c;
	int weight;
	int lchild;
	int rchild;
	int parent;
	bool flag;
}Huffman_Node;

//寻找权值最小的两个结点，即lchild, rchild; 
void Select_Min(Huffman_Node Nodes[], int *lchild, int *rchild, int n)
{
	int minn = inf;
	for(int i = 0; i < n; i++)
	{
		if(Nodes[i].flag == false && Nodes[i].weight < minn)
		{
			minn = Nodes[i].weight;
			*lchild = i;
		}
	}
	Nodes[*lchild].flag = true;
	minn = inf;
	for(int i = 0; i < n; i++)
	{
		if(Nodes[i].flag == false && Nodes[i].weight < minn)
		{
			minn = Nodes[i].weight;
			*rchild = i;
		}
	}
	Nodes[*rchild].flag = true;
}

void Huffman_Tree(Huffman_Node Nodes[], char ch[], int weight[], int n)
{
	//对每个结点进行初始化 
	for(int i = 0; i < n; i++)
	{
		Nodes[i].c = ch[i];
		Nodes[i].weight = weight[i];
	}
	for(int i = 0; i < 2 * n - 1; i++)
	{
		Nodes[i].lchild = Nodes[i].rchild = Nodes[i].parent = -1;
		Nodes[i].flag = false;	
	}
	//在Nodes[]数组剩余空间内，形成新的结点 
	for(int k = n; k < 2 * n - 1; k++)
	{
		// lchild:在已建立结点中寻找的权值最小的结点
		// rchild:在已建立结点中寻找的权值第二小的结点 
		int lchild = 0, rchild = 0;		
		Select_Min(Nodes, &lchild, &rchild, k);
		//增添新的结点 
		Nodes[lchild].parent = k;
		Nodes[rchild].parent = k;
		Nodes[k].lchild = lchild;
		Nodes[k].rchild = rchild;
		Nodes[k].weight = Nodes[lchild].weight + Nodes[rchild].weight;
	}
}

//打印哈夫曼编码 
void Huffman_Code(Huffman_Node Nodes[], int n)
{
	string s = " ";
	int j;
	for(int i = 0; i < n; i++)
	{
		s = " ";
		j = i;
		int parent;
		while(Nodes[j].parent != -1)
		{
			parent = Nodes[j].parent;
			//如果这个结点在其父节点左边，其分支为0， 否则分支为1 
			if(j == Nodes[parent].lchild)
				s = s + "0";
			else 
				s = s + "1";
			j = Nodes[j].parent;
		}	
		cout << "字符" << Nodes[i].c << "的哈夫曼编码是：" << endl;
		for(int k = s.length() - 1; k >= 0; k--)
		{
			cout << s.at(k) << " ";
		}
		cout << endl;
	}
}

int main()
{
	int n = 6;
	Huffman_Node Nodes[2 * n - 1];	//n个字符的最优二叉树共有2*(n-1)个结点
	char ch[] = { 'a', 'b', 'c', 'd', 'e', 'f' };
    int weight[] = { 45, 13, 12, 16, 9, 5 };
    cout << "待编码字符为：" << endl;
	for(int i = 0; i < n; i++)
		cout << ch[i] << " ";
	cout << endl;
	cout << "其权值分别为：" << endl;
	for(int i = 0; i < n; i++)
		cout << weight[i] << " ";
	cout << endl; 
    Huffman_Tree(Nodes, ch, weight, n);
    Huffman_Code(Nodes, n);
	return 0;
}