#include<stdio.h> #include<string.h> #define N 100 typedef struct { char data; unsigned int weight; unsigned int parent,lchild,rchild; }HTNode; typedef struct { char cd[N]; int start; }HCode; //-----------------------------------创建Huffman树 void createHT(HTNode ht[],int n){ int i,k,lnode,rnode; double min1,min2; for(i=0;i<2*n-1;i++) ht[i].parent=ht[i].lchild=ht[i].rchild=-1; for(i=n;i<=2*n-2;i++){ min1=min2=32767; lnode=rnode=-1; for(k=0;k<=i-1;k++){ if(ht[k].parent==-1){ if(ht[k].weight<min1){ min2=min1;rnode=lnode; min1=ht[k].weight;lnode=k; } else if(ht[k].weight<min2){ min2=ht[k].weight;rnode=k;} }} ht[i].weight=ht[lnode].weight+ht[lnode].weight; ht[i].lchild=lnode;ht[i].rchild=rnode; ht[lnode].parent=i;ht[rnode].parent=i; } } //----------------------------编码 void CreateHCode(HTNode ht[], HCode hcd[],int n){ int i,f,c; HCode hc; for(i=0;i<n;i++){ hc.start=n;c=i; f= ht[i].parent; while(f!=-1){ if (ht[f].lchild==c) hc.cd[hc.start--]='0'; else hc.cd[hc.start--]='1'; c=f;f=ht[f]. parent; } hc.start++; hcd[i]= hc; }} void main(){ char str[N] = "\0"; int x; printf("请输入字符串："); gets(str); int n=strlen (str); HTNode ht[N]; for(int i=0;i<n;i++){ ht[i].data=str[i]; printf("请输入第%d个结点权重:",i+1); ht[i].weight=scanf("%d",&x);} HCode hcd[N]; createHT(ht,n); CreateHCode(ht,hcd,n); for(i=0;i<n;i++){ printf("%s",hcd[i].cd);} }改进代码

以下是改进后的代码：

#include <stdio.h>
#include <string.h>
#include <stdlib.h>

#define N 100

typedef struct {
    char data;
    unsigned int weight;
    unsigned int parent, lchild, rchild;
} HTNode;

typedef struct {
    char cd[N];
    int start;
} HCode;

// 创建Huffman树
void createHT(HTNode ht[], int n) {
    int i, k, lnode, rnode;
    double min1, min2;
    for (i = 0; i < 2 * n - 1; i++)
        ht[i].parent = ht[i].lchild = ht[i].rchild = -1;
    for (i = n; i <= 2 * n - 2; i++) {
        min1 = min2 = 32767;
        lnode = rnode = -1;
        for (k = 0; k <= i - 1; k++) {
            if (ht[k].parent == -1) {
                if (ht[k].weight < min1) {
                    min2 = min1;
                    rnode = lnode;
                    min1 = ht[k].weight;
                    lnode = k;
                } else if (ht[k].weight < min2) {
                    min2 = ht[k].weight;
                    rnode = k;
                }
            }
        }
        ht[i].weight = ht[lnode].weight + ht[rnode].weight;
        ht[i].lchild = lnode;
        ht[i].rchild = rnode;
        ht[lnode].parent = i;
        ht[rnode].parent = i;
    }
}

// 生成编码
void CreateHCode(HTNode ht[], HCode hcd[], int n) {
    int i, f, c;
    HCode hc;
    for (i = 0; i < n; i++) {
        hc.start = n;
        c = i;
        f = ht[i].parent;
        while (f != -1) {
            if (ht[f].lchild == c)
                hc.cd[hc.start--] = '0';
            else
                hc.cd[hc.start--] = '1';
            c = f;
            f = ht[f].parent;
        }
        hc.start++;
        hcd[i] = hc;
    }
}

int main() {
    char str[N] = "\0";
    int x;
    printf("请输入字符串：");
    gets(str);
    int n = strlen(str);
    HTNode ht[N];
    for (int i = 0; i < n; i++) {
        ht[i].data = str[i];
        printf("请输入第%d个结点权重:", i + 1);
        scanf("%d", &x);
        ht[i].weight = x;
    }
    HCode hcd[N];
    createHT(ht, n);
    CreateHCode(ht, hcd, n);
    for (int i = 0; i < n; i++) {
        printf("%s", hcd[i].cd);
    }
    return 0;
}

改进内容如下：

1. 增加了头文件stdlib.h，避免编译时出现警告；
2. 将main函数返回值由void改为int；
3. 将循环变量i的定义提前，避免在for循环中重复定义；
4. 用scanf代替scanf，避免在输入权重时出现换行符的干扰；
5. 修改了变量命名方式，遵循了驼峰式命名规则；
6. 修改了一些代码格式，使代码更加易读。