-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathHuffmanEncoder.java
More file actions
110 lines (78 loc) · 2.09 KB
/
HuffmanEncoder.java
File metadata and controls
110 lines (78 loc) · 2.09 KB
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
import java.util.HashMap;
import java.util.Map;
import java.util.PriorityQueue;
public class HuffmanEncoder {
class Node implements Comparable<Node> {
char data;
int wt;
Node left;
Node right;
@Override
public int compareTo(Node o) {
// TODO Auto-generated method stub
return this.wt - o.wt;
}
}
HashMap<Character, String> encoder = new HashMap<Character, String>();
HashMap<String, Character> decoder = new HashMap<String, Character>();
public void display() {
System.out.println("encoder");
System.out.println(encoder);
System.out.println();
System.out.println("decoder");
System.out.println(decoder);
}
public HuffmanEncoder(String str) {
java.util.HashMap<Character, Integer> freq = new HashMap<Character, Integer>();
for (int i = 0; i < str.length(); i++) {
char ch = str.charAt(i);
freq.put(ch, freq.getOrDefault(ch, 0) + 1);
}
PriorityQueue<Node> pq = new PriorityQueue<HuffmanEncoder.Node>();
for (Map.Entry<Character, Integer> entry : freq.entrySet()) {
Node node = new Node();
node.data = entry.getKey();
node.wt = entry.getValue();
pq.add(node);
}
while (pq.size() > 1) {
Node one = pq.remove();
Node two = pq.remove();
Node node = new Node();
node.data = '\0';
node.wt = one.wt + two.wt;
node.left = one;
node.right = two;
pq.add(node);
}
populateEncoderDecoder(pq.remove(), "");
}
public void populateEncoderDecoder(Node node, String asf) {
if (node == null)
return;
if (node.left == null && node.right == null) {
encoder.put(node.data, asf);
decoder.put(asf, node.data);
}
populateEncoderDecoder(node.left, asf + "0");
populateEncoderDecoder(node.right, asf + "1");
}
public String encode(String str) {
String rv = "";
for (int i = 0; i < str.length(); i++)
rv += encoder.get(str.charAt(i));
return rv;
}
public String decode(String str) {
String rv = "";
String qsf = "";
for (int i = 0; i < str.length(); i++) {
qsf += str.charAt(i);
if(decoder.containsKey(qsf)) {
rv += decoder.get(qsf);
qsf = "";
}
}
return rv;
}
}