-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathHuffman.java
More file actions
70 lines (62 loc) · 2.29 KB
/
Huffman.java
File metadata and controls
70 lines (62 loc) · 2.29 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
import java.util.HashMap;
import java.util.Map;
import java.util.PriorityQueue;
import java.util.Queue;
import java.util.*;
public class Huffman {
private Node root;
private final String text;
private Map<Character, Integer> charFrequencies; // A dictionary like datatype containing Character integer pairs.
private final Map<Character, String> huffmanCodes;
public Huffman(String text) {
this.text = text;
fillCharFrequenciesMap();
huffmanCodes = new HashMap<>();
}
private void fillCharFrequenciesMap() {
charFrequencies = new HashMap<>();
for (char character : text.toCharArray()) {
charFrequencies.put(character, charFrequencies.getOrDefault(character, 0) + 1);
}
}
public String encode() {
Queue<Node> queue = new PriorityQueue<>();
charFrequencies.forEach((character, frequency) -> queue.add(new Leaf(character, frequency)));
while (queue.size() > 1) {
queue.add(new Node(queue.poll(), queue.poll()));
}
root = queue.poll();
generateHuffmanCodes(root, "");
return getEncodedText();
}
private void generateHuffmanCodes(Node node, String code) {
if (node instanceof Leaf) {
huffmanCodes.put(((Leaf) node).getCharacter(), code);
return;
}
generateHuffmanCodes(node.getLeftNode(), code.concat("0"));
generateHuffmanCodes(node.getRightNode(), code.concat("1"));
}
private String getEncodedText() {
StringBuilder sb = new StringBuilder();
for (char character : text.toCharArray()) {
sb.append(huffmanCodes.get(character));
}
return sb.toString();
}
public String decode(String encodedText) {
StringBuilder sb = new StringBuilder();
Node current = root;
for (char character : encodedText.toCharArray()) {
current = character == '0' ? current.getLeftNode() : current.getRightNode();
if (current instanceof Leaf) {
sb.append(((Leaf) current).getCharacter());
current = root;
}
}
return sb.toString();
}
public void printCodes() {
huffmanCodes.forEach((character, code) -> System.out.println(character + ": " + code));
}
}