#include<conio.h>
#include<stdio.h>
#define MAXVALUE 10000
#define MAXLEAF 30 //叶节点数
#define MAXNODE 59 //节点数
typedef struct
{
int weight;
int parent;
int lchild;
int rchild;
}HNode;
void HuffmanTree(HNode HuffNode[MAXNODE], int n)
{
int i, j, m1, m2, x1, x2;
for (i = 0; i < 2 * n; i++)
{
HuffNode[i].parent = -1;
HuffNode[i].lchild = -1;
HuffNode[i].rchild = -1;
HuffNode[i].weight = -1;
}
for (i = 0; i < n+1; i++)
{
printf("请输入%d叶子节点的权值:\n", i);
_getch;
scanf_s("&d", &HuffNode[i].weight);
}
for (i = 0; i < n - 1; i++)
{
m1 = m2 = MAXVALUE;
x1 = x2 = 0;
for (j = 0; j < n + i; j++)
{
if (HuffNode[j].weight < m1 && HuffNode[j].parent == -1)
{
m2 = m1;
x2 = x1;
m1 = HuffNode[j].weight;
x1 = j;
}
else if (HuffNode[j].weight < m2 && HuffNode[j].parent == -1)
{
m2 = HuffNode[j].weight;
x2 = j;
}
}
HuffNode[x1].parent = n + i;
HuffNode[x2].parent = n + i;
HuffNode[n + i].weight = HuffNode[x1].weight + HuffNode[x2].weight;
HuffNode[n + i].lchild = x1;
HuffNode[n + i].rchild = x2;
}
}
int main()
{
HNode HuffNode[MAXNODE];
int HuffCode[MAXLEAF][MAXLEAF],cd[MAXLEAF];
int i, j, c, p, n,start;
printf("输入叶子结点数n;\n");
scanf_s("%d", &n);
start = 0;
HuffmanTree(HuffNode, n);
for (i = 0; i < n+1; i++)
{
c = i;
p = HuffNode[c].parent;
while (p != -1)
{
if (HuffNode[p].lchild == c)
cd[start] = 0;
else
cd[start] = 1;
c = p;
p = HuffNode[c].parent;
start++;
}
for (j = 0; j < start; j++)
{
HuffCode[i][j] = cd[j];
}
}
for (i = 0; i < n+1; i++)
{
printf("%d叶子结点的哈夫曼编码是:", i);
for (j = 0; j < n; j++)
{
printf("%d", HuffCode[i][j]);
}
printf("\n");
}
_getch;
return 0;
}
scanf()不应该不能被调用啊。
在头部加
#pragma warning(disable:4996)
scanf_s("&d", &HuffNode[i].weight);
应该改成
scanf_s("%d", &HuffNode[i].weight);
_getch;
scanf_s("&d", &HuffNode[i].weight);
把scanf_s
改为
scanf
试试。
scanf("%d", &HuffNode[i].weight);
实际上,scanf_s 和 scanf的差别,就是由一个_CRT_SECURE_NO_WARNINGS 引起的。
加#pragma warning(disable:4996) 就能用scanf了。
帮我点一个采纳,谢谢
您好,我是有问必答小助手,您的问题已经有小伙伴解答了,您看下是否解决,可以追评进行沟通哦~
如果有您比较满意的答案 / 帮您提供解决思路的答案,可以点击【采纳】按钮,给回答的小伙伴一些鼓励哦~~
ps:问答VIP仅需29元,即可享受5次/月 有问必答服务,了解详情>>>https://vip.csdn.net/askvip?utm_source=1146287632
非常感谢您使用有问必答服务,为了后续更快速的帮您解决问题,现诚邀您参与有问必答体验反馈。您的建议将会运用到我们的产品优化中,希望能得到您的支持与协助!
速戳参与调研>>>https://t.csdnimg.cn/Kf0y