修复错误代码#include<stdio.h> #define MAXLEN 100 typedef struct { char data; int weight; int lchild, rchild, parent; }HTNode; typedef HTNode HT[MAXLEN]; int n; void InitHFMT(HT T) { printf("\n请输入共有多少个权值（小于100）："); scanf_s("%d", &n); for ( int i = 0; i < 2 * n - 1; i++) { T[i].weight = 0; T[i].lchild = -1; T[i].rchild = -1; T[i].parent = -1; } } void InputWeight(HT T) { int i; for ( i = 0; i < n; i++) { printf("请输入第%d个数据域和权值:\n", i + 1); getchar(); T[i].data = getchar(); scanf_s("%d", &T[i].weight); } } void SelectMin(HT T, int i, int* p1, int* p2) { long min1 = 8888888, min2 = 888888; int j; for (j = 0; j <= i; j++) { if (T[j].parent == -1) { if (min1 > T[j].weight) { min1 = T[j].weight; *p1 = j; } } } for (j = 0; j <= i; j++) { if (T[j].parent == -1) { if (min1 > T[j].weight && j != (*p1)) { min2 = T[j].weight; *p2 = j; } } } } void CreatHFMT(HT T) { int i, p1, p2; InitHFMT(T); InputWeight(T); //InputDataWeight(T); for (i = n; i < 2 * n - 1; i++) { SelectMin(T, i - 1, &p1, &p2); T[p1].parent = T[p2].parent = i; T[i].lchild = T[p1].weight; T[i].rchild = T[p2].weight; T[i].weight = T[p1].weight + T[p2].weight; } } void PrintHFMT(HT T) { int i; printf("\n哈夫曼树的各边显示:\n"); for (i = 0; i < 2 * n - 1; i++) { printf("(%d,%d),(%d,%d)\n", T[i].weight, T[i].lchild, T[i].rchild); break; } } void hfnode(HT T, int i, int j) { j = T[i].parent; if (T[j].rchild == T[i].weight) printf("0"); else printf("1"); if (T[j].parent != -1) { i = j; hfnode(T, i); } } void huffmannode(HT T) { int i, j, a; printf("\n,输入的权值的对应哈夫曼编码:"); for (i = 0; i < n; i++) { printf("\n%i的编码为:", T[i].data); hfnode(T, i); printf("\n"); } } void main() { HT HT; CreatHFMT(HT); PrintHFMT(HT); huffmannode(HT); printf("\n"); }

首先，这段代码存在一些问题，如在输入数据域和权值时需要使用 getchar() 函数处理换行符，同时在递归函数 hfnode() 中没有正确传入参数，可能会导致编译错误。以下是修复后的代码：

#include<stdio.h> 
#define MAXLEN 100 

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

typedef HTNode HT[MAXLEN]; 

int n; 

void InitHFMT(HT T) { 
    printf("\n请输入共有多少个权值（小于100）："); 
    scanf_s("%d", &n); 
    for (int i = 0; i < 2 * n - 1; i++) { 
        T[i].weight = 0; 
        T[i].lchild = -1; 
        T[i].rchild = -1; 
        T[i].parent = -1; 
    } 
} 

void InputWeight(HT T) { 
    int i; 
    for (i = 0; i < n; i++) { 
        printf("请输入第%d个数据域和权值:\n", i + 1); 
        getchar(); 
        T[i].data = getchar(); 
        scanf_s("%d", &T[i].weight); 
    } 
} 

void SelectMin(HT T, int i, int* p1, int* p2) { 
    long min1 = 8888888, min2 = 888888; 
    int j; 
    for (j = 0; j <= i; j++) { 
        if (T[j].parent == -1) { 
            if (min1 > T[j].weight) { 
                min1 = T[j].weight; 
                *p1 = j; 
            } 
        } 
    } 
    for (j = 0; j <= i; j++) { 
        if (T[j].parent == -1) { 
            if (min2 > T[j].weight && j != (*p1)) { 
                min2 = T[j].weight; 
                *p2 = j; 
            } 
        } 
    } 
} 

void CreatHFMT(HT T) { 
    int i, p1, p2; 
    InitHFMT(T); 
    InputWeight(T); 
    for (i = n; i < 2 * n - 1; i++) { 
        SelectMin(T, i - 1, &p1, &p2); 
        T[p1].parent = T[p2].parent = i; 
        T[i].lchild = p1; 
        T[i].rchild = p2; 
        T[i].weight = T[p1].weight + T[p2].weight; 
    } 
} 

void PrintHFMT(HT T) { 
    int i; 
    printf("\n哈夫曼树的各边显示:\n"); 
    for (i = 0; i < 2 * n - 1; i++) { 
        printf("(%d,%d),(%d,%d)\n", T[i].weight, T[i].lchild, T[i].rchild); 
    } 
} 

void hfnode(HT T, int i) { 
    int j = T[i].parent; 
    if (T[j].rchild == i) { 
        printf("0"); 
    } else { 
        printf("1"); 
    } 
    if (T[j].parent != -1) { 
        hfnode(T, j); 
    } 
} 

void huffmannode(HT T) { 
    int i; 
    printf("\n输入的权值的对应哈夫曼编码:\n"); 
    for (i = 0; i < n; i++) { 
        printf("%c的编码为: ", T[i].data); 
        hfnode(T, i); 
        printf("\n"); 
    } 
} 

int main() { 
    HT HT; 
    CreatHFMT(HT); 
    PrintHFMT(HT); 
    huffmannode(HT); 
    return 0; 
}

修正错误后，代码可以正确运行并实现哈夫曼编码的生成。