-
Notifications
You must be signed in to change notification settings - Fork 0
/
Huffman.cpp
146 lines (146 loc) · 3.08 KB
/
Huffman.cpp
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
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
#define LOCA
#include <iostream>
using namespace std;
class huffmanTree;
class huffmanTreeNode
{
friend huffmanTree& buildTree(huffmanTree* t, int num);
friend huffmanTree;
char element;
int weight, height;
int* code;
bool ele;
huffmanTreeNode* leftChild, * rightChild, * father;
public:
huffmanTreeNode(int theWeight,bool e=0, char theElement=0 )
{
element = theElement;
weight = theWeight;
ele = e;
height = 1;
leftChild = rightChild = NULL;
father = NULL;
}
huffmanTreeNode(huffmanTreeNode& t)
{
element = t.element;
weight = t.weight;
height = t.height;
ele = t.ele;
if (t.leftChild != NULL) {
leftChild = new huffmanTreeNode(*t.leftChild);
leftChild->father = this;
}
if (t.rightChild != NULL) {
rightChild = new huffmanTreeNode(*t.rightChild);
rightChild->father = this;
}
}
friend void visit(huffmanTreeNode*);
};
void visit(huffmanTreeNode* t)
{
if (t->ele)
{
cout << t->element << ":";
for (int i = 0; i < t->height - 1; i++)
cout << t->code[i];
cout << endl;
}
}
class huffmanTree
{
public:
huffmanTreeNode* root;
public:
huffmanTree() {}
huffmanTree(int theWeight,bool e=0,char theElement=0) {
root = new huffmanTreeNode(theWeight, e, theElement);
}
huffmanTree(huffmanTree& t)
{
root = new huffmanTreeNode(*t.root);
root->code = NULL;
}
void combine(huffmanTree& r)
{
this->root->father = new huffmanTreeNode(root->weight + r.root->weight, 0);
this->root->father->rightChild = root;
this->root->father->leftChild = r.root;
r.root->father = root->father;
this->root = this->root->father;
this->root->father = NULL;
#ifdef LOCA
cout << "combining" << root->weight << " " << root->leftChild->weight << " " << root->rightChild->weight << endl;
#endif
}
void DFS(huffmanTreeNode* t,int type)
{
if (t != NULL)
{
if (t != root)
{
t->height = t->father->height + 1;
t->code = new int[t->height - 1];
for (int i = 0; i < t->height-2; i++)
t->code[i] = t->father->code[i];
t->code[t->height - 2] = type;
}
DFS(t->leftChild,0);
visit(t);
DFS(t->rightChild,1);
}
}
friend huffmanTree& buildTree(huffmanTree*,int);
};
template<class T>
void sswap(T& a1, T& a2)
{
T t = a1;
a1 = a2;
a2 = t;
}
huffmanTree& buildTree(huffmanTree* t, int num)
{
int index = 0;
while (index < num - 1)
{
int minweight1 = t[index].root->weight;
int minweight2 = t[index + 1].root->weight;
for (int i = index; i < num; i++)
if (t[i].root->weight < minweight1)
{
sswap(t[i], t[index]);
minweight1 = t[index].root->weight;
minweight2 = t[index + 1].root->weight;
}
for(int i=index+1;i<num;i++)
if (t[i].root->weight < minweight2)
{
sswap(t[i], t[index + 1]);
minweight2 = t[index + 1].root->weight;
}
t[index + 1].combine(t[index]);
index++;
}
return t[num - 1];
}
int main()
{
int num;
cin >> num;
huffmanTree* forest = new huffmanTree[num];
for (int i = 0; i < num; i++)
{
char c;
int in;
cin >> c >> in;
huffmanTree t(in, 1, c);
forest[i] = t;
}
huffmanTree tree = buildTree(forest, num);
tree.DFS(tree.root,0);
#ifdef LOCA
system("pause");
#endif
}