原题复刻:
思想的火花:
此题是答主写的 [HNUST-OJ-2184-huffman编码(1)]的变种,此题仅仅需要将"select"函数返回的s1与s2两个值,s1存取按输入顺序来看更小的,s2存取更大的。
可以用if判断语句,也可以调用函数min和max;
呈上代码:
#include<iostream>
#include<cstring>
using namespace std;
typedef struct
{
int weight;
int parent,lchild,rchild;
} HTNode,*HuffmanTree;
typedef char **HuffmanCode;
void Select(HuffmanTree HT,int len,int &s1,int &s2)
{
/****在此下面完成代码***************/
int min1=200,min2=200;
for(int i=1; i<=len; i++)
{
if(HT[i].weight<min1&&HT[i].parent==0)
{
min1=HT[i].weight;
s1=i;
}
}
for(int i=1; i<=len; i++)
{
if(i!=s1&&HT[i].weight<min2&&HT[i].parent==0)
{
min2=HT[i].weight;
s2=i;
}
}
/***********************************/
}
//用算法5.10构造赫夫曼树
void CreatHuffmanTree(HuffmanTree &HT,int n)
{
//构造赫夫曼树HT
int m,s1,s2,i;
if(n<=1)return;
m=2*n-1;
HT=new HTNode[m+1]; //0号单元未用,所以需要动态分配m+1个单元,HT[m]表示根结点
for(i=1; i<=m; ++i) //将1~m号单元中的双亲、左孩子,右孩子的下标都初始化为0
{
HT[i].parent=0;
HT[i].lchild=0;
HT[i].rchild=0;
}
//cout<<"请输入叶子结点的权值:\n";
for(i=1; i<=n; ++i) //输入前n个单元中叶子结点的权值
cin>>HT[i].weight;
/*――――――――――初始化工作结束,下面开始创建赫夫曼树――――――――――*/
for(i=n+1; i<=m; ++i)
{
//通过n-1次的选择、删除、合并来创建赫夫曼树
Select(HT,i-1,s1,s2);
//在HT[k](1≤k≤i-1)中选择两个其双亲域为0且权值最小的结点,
// 并返回它们在HT中的序号s1和s2
HT[s1].parent=i;
HT[s2].parent=i;
//得到新结点i,从森林中删除s1,s2,将s1和s2的双亲域由0改为i
HT[i].lchild=min(s1,s2);
HT[i].rchild=max(s2,s1) ; //s1,s2分别作为i的左右孩子
HT[i].weight=HT[s1].weight+HT[s2].weight; //i 的权值为左右孩子权值之和
} //for
}
void CreadHuffmanCode(HuffmanTree HT, HuffmanCode &HC, int n)
{
HC = new char*[n+1];
char *cd=new char[n];
cd[n-1] = '\0';
int start, c, f;
for(int i=1; i<=n; i++)
{
start = n-1;
c = i;
f = HT[i].parent;
while(f!=0)
{
--start;
if(HT[f].lchild==c)
cd[start] = '0';
else
cd[start] = '1';
c = f;
f = HT[f].parent;
}
HC[i] = new char[n-start];
strcpy(HC[i], &cd[start]);
}
delete cd;
} // CreatHuffmanTree
int main()
{
HuffmanTree HT;
HuffmanCode HC;
int n;
cin>>n; //输入赫夫曼树的叶子结点个数
CreatHuffmanTree(HT,n);
CreadHuffmanCode(HT, HC, n);
for(int i=1;i<=n;i++)cout<<HC[i]<<endl;
//cout<<countWPL(HT,n);
return 0;
}
//补个跳出本题提醒的版本
#include<iostream>
#include<cstring>
#define MAX 1000006
using namespace std;
struct tree
{
int weight;
int parent,l,r;
};
void zhaoxiao(tree *HT,int len,int &s1,int &s2)
{
int small=MAX;
for(int i=1; i<=len; i++)
{
if(HT[i].weight<small&&!HT[i].parent)small=HT[i].weight,s1=i;
}
small=MAX;
for(int i=1; i<=len; i++)
{
if(HT[i].weight<small&&!HT[i].parent&&i!=s1)small=HT[i].weight,s2=i;
}
}
int main()
{
tree *shu;
char **ma;
int n;
cin>>n;
int m=2*n-1;
shu=new tree[m+1];
for(int i=1; i<=m; i++)shu[i].parent=0,shu[i].l=0,shu[i].r=0;
for(int i=1; i<=n; i++)cin>>shu[i].weight;
for(int i=n+1; i<=m; i++)
{
int s1,s2;
zhaoxiao(shu,i-1,s1,s2);
if(s1>s2)swap(s1,s2);
shu[s1].parent=shu[s2].parent=i;
shu[i].l=s1,shu[i].r=s2;
shu[i].weight=shu[s1].weight+shu[s2].weight;
}
ma=new char*[n+1];
char *cd=new char[n];
cd[n-1]='\0';
for(int i=1; i<=n; i++)
{
int start=n-1,c=i,f=shu[i].parent;
while(f)
{
start--;
cd[start]=shu[f].l==c?'0':'1';
c=f;
f=shu[f].parent;
}
ma[i]=new char[n-start];
strcpy(ma[i],&cd[start]);
}
delete cd;
for(int i=1; i<=n; i++)cout<<ma[i]<<endl;
}