/
9huffman.c
99 lines (93 loc) · 2.74 KB
/
9huffman.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
/*************************************************************************
> File Name: 9huffman.c
> Author: snowflake
> Mail: ︿( ̄︶ ̄)︿
> Created Time: 2018年09月16日 星期日 10时25分54秒
************************************************************************/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define swap(a, b) { \
__typeof(a) temp; \
temp = a; a = b; b = temp; \
}
typedef struct HFNode {
char ch;
int freq;
struct HFNode *lchild, *rchild;
} HFNode;
HFNode *get_node() {
HFNode *p = (HFNode *)calloc(sizeof(HFNode), 1);
p->lchild = p->rchild = NULL;
}
void build(int n, HFNode *arr[]) {
for (int times = 0; times < n - 1; times++) {
HFNode *minNode = arr[0];
int ind = 0;
for (int i = 1; i < n - times; i++) {
if (arr[i]->freq >= minNode->freq) continue;
minNode = arr[i];
ind = i;
}
swap(arr[ind], arr[n - times - 1]);
minNode = arr[0];
for (int i = 1; i < n - times - 1; i++) {
if (arr[i]->freq >= minNode->freq) continue;
minNode = arr[i];
ind = i;
}
swap(arr[ind], arr[n - times - 2]);
HFNode *newNode = get_node();
newNode->lchild = arr[n - times - 2];
newNode->rchild = arr[n - times - 1];
newNode->freq = arr[n - times - 2]->freq + arr[n - times - 1]->freq;
arr[n - times - 2] = newNode;
}
return ;
}
void extract(char (*hfnode)[100], char *buffer, HFNode *root, int n) {
buffer[n] = '\0';
if (root->lchild == NULL && root->rchild == NULL) {
strcpy(hfnode[root->ch + 128], buffer);
return ;
}
buffer[n] = '0';
extract(hfnode, buffer, root->lchild, n + 1);
buffer[n] = '1';
extract(hfnode, buffer, root->rchild, n + 1);
return ;
}
int main() {
FILE *fp = fopen("./1vector.c", "r");
char hfnode[256][100] = {0};
HFNode *arr[256] = {0};
char buffer[1024] = {0};
for (int i = 0; i < 256; i++) {
arr[i] = get_node();
}
int freq[256] = {0};
while (fread(buffer, sizeof(char), 1024, fp) != 0) {
for (int i = 0; buffer[i]; i++) {
int ind = buffer[i] + 128;
freq[buffer[i] + 128]++;
}
memset(buffer, 0, 1024);
}
fclose(fp);
int count = 0;
for (int i = 0; i < 256; i++) {
if (freq[i] == 0) continue;
HFNode *newNode = get_node();
newNode->ch = (char)i;
newNode->freq = freq[i];
arr[count++] = newNode;
}
//fflush(stdout);
build(count, arr);
extract(hfnode, buffer, arr[0], 0);
for (int i = 0; i < 256; i++) {
if (hfnode[i][0] == 0) continue;
printf("%d %s\n", i, hfnode[i]);
}
return 0;
}