链表实现哈夫曼编码相比数组比较简单。
//创建哈夫曼节点
typedef struct node{
char word;
int weight;
struct node *left, *right;
}HuffmanNode;
//创建哈夫曼树
HuffmanNode* creatHuffmanTree(char word[], int weight[]){
int loop, i, k1, k2, n;
n = strlen(word);
HuffmanNode **F, *pa;
//创建森林
F = (HuffmanNode**)malloc(sizeof(HuffmanNode*)*n);
for (int i = 0; i < n; i++){
F[i] = (HuffmanNode*)malloc(sizeof(HuffmanNode));
}
//将二叉树放入森林中
for (i = 0; i < n; i++){
F[i]->word = word[i];
F[i]->weight = weight[i];
F[i]->left = F[i]->right = NULL;
}
//创建哈夫曼树
for (loop = 1; loop < n; loop++){
//找到森林中第一个二叉树
for (k1 = 0; k1 < n&&!F[k1]; k1++);
//找到森林中第二个二叉树
for (k2 = k1 + 1; k2 < n&&!F[k2]; k2++);
//找到森林中权值最小和权值次小的二叉树
for (i = k2; i < n; i++){
if (F[i]){
if (F[i]->weight < F[k1]->weight){
k2 = k1;
k1 = i;
}
else if (F[i]->weight < F[k2]->weight){
k2 = i;
}
}
}printf("\n%d,%d\n",F[k1]->weight,F[k2]->weight);
//重建二叉树
pa = (HuffmanNode*)malloc(sizeof(HuffmanNode));
pa->left = F[k1];
pa->right = F[k2];
pa->word = '\0';
pa->weight = F[k1]->weight + F[k2]->weight;
//将森林中原来的最小和次小二叉树移除,并将新建的二叉树放入森林中
F[k1] = pa;
F[k2] = NULL;
}
return F[k1];
}
本人还暂时没有想好怎么编码,陆续会更新哒哒哒哒…….