+/EE360C

algorithms

git clone https://git.julia.blue/+/EE360C

Joseph RyanFinish lab 2381a8ab

master
1.5 KiB47 linesraw
1import java.util.*;
2import java.util.stream.Collectors;
3
4public class HuffmanTree {
5    TreeNode root = null;
6    Map<String, String> m;
7
8    public void constructHuffmanTree(List<String> characters,
9                                     List<Integer> freq) {
10        PriorityQueue<TreeNode> q = new PriorityQueue<>();
11        for (int i = 0; i < freq.size(); ++i) {
12            q.add(new TreeNode(characters.get(i), freq.get(i)));
13        }
14        while (q.size() > 1) {
15            TreeNode a = q.poll();
16            TreeNode b = q.poll();
17            q.add(new TreeNode(a, b));
18        }
19        root = q.poll();
20        m = root.getMap();
21    }
22
23    public String encode(String humanMessage) {
24        return humanMessage.trim()
25            .chars()
26            .mapToObj(c -> m.get(String.valueOf((char)c)))
27            .collect(Collectors.joining());
28    }
29
30    public String decode(String encodedMessage) {
31        String message = encodedMessage.trim();
32        String result = "";
33        Map<String, String> dec_map = m.entrySet().stream().collect(
34            Collectors.toMap(HashMap.Entry::getValue, HashMap.Entry::getKey));
35        int pos = 0;
36        String current = "";
37        do {
38            int size = 0;
39            do {
40                current = message.substring(pos, ++size + pos);
41            } while (!dec_map.containsKey(current));
42            result += dec_map.get(current);
43            pos += size;
44        } while (pos < message.length());
45        return result;
46    }
47}