赫夫曼树实现数据解压缩

import java.util.*;

public class HuffmanCodeDemo {

    public static void main(String[] args) {
        String str = "i like like like java do you like a java";
        byte[] bytes = str.getBytes();
        byte[] huffmanZip = huffmanZip(bytes);

        char[] decode = decode(huffmanCode, huffmanZip);
        System.out.println(Arrays.toString(decode));
    }

    public static byte[] huffmanZip(byte[] bytes) {
        ArrayList<Node> nodes = getNodes(bytes);
        Node huffmanTreeRoot = createHuffmanTree(nodes);
        getCodes(huffmanTreeRoot);
        byte[] zip = zip(bytes, huffmanCode);
        return zip;

    }

    public static char[] decode(Map<Byte, String> huffmanCodes, byte[] huffmanBytes) {
        StringBuilder stringBuilder = new StringBuilder();
        for (int i = 0; i < huffmanBytes.length; i++) {
            byte b = huffmanBytes[i];
            boolean flag = !(i == (huffmanBytes.length - 1));
            stringBuilder.append(byteToBitString(flag, b));
        }
        Map<String, Byte> map = new HashMap<>();
        for (Map.Entry<Byte, String> entry : huffmanCodes.entrySet()) {
            map.put(entry.getValue(), entry.getKey());
        }
        List<Byte> list = new ArrayList<>();
        for (int i = 0; i < stringBuilder.length(); ) {
            int count = 1;
            boolean flag = true;
            Byte b = null;

            while (flag) {
                String key = stringBuilder.substring(i, i + count);
                b = map.get(key);
                if (b == null) {
                    count++;
                } else {
                    flag = false;
                }
            }
            list.add(b);
            i += count;
        }
        int size = list.size();
        char[] c = new char[size];
        for (int i = 0; i < size; i++) {
            c[i] = (char)list.get(i).byteValue();
        }
        return c;

    }

    public static String byteToBitString(boolean flag, byte b) {
        int temp = b;
        if (flag) {
            temp |= 256;
        }
        String str = Integer.toBinaryString(temp);
        if (flag) {
            return str.substring(str.length() - 8);
        } else {
            return str;
        }

    }


    public static ArrayList<Node> getNodes(byte[] bytes) {
        ArrayList<Node> list = new ArrayList<>();
        HashMap<Byte, Integer> counts = new HashMap<>();
        int len = bytes.length;
        for (int i = 0; i < len; i++) {
            Integer count = counts.get(bytes[i]);
            if (count == null) {
                counts.put(bytes[i], 1);
            } else {
                counts.put(bytes[i], count + 1);
            }
        }
        for (Map.Entry<Byte, Integer> entry : counts.entrySet()) {
            list.add(new Node(entry.getKey(), entry.getValue()));
        }
        return list;
    }

    public static Node createHuffmanTree(ArrayList<Node> nodes) {
        while (nodes.size() > 1) {
            Collections.sort(nodes);
            Node leftNode = nodes.get(0);
            Node rightNode = nodes.get(1);
            nodes.remove(leftNode);
            nodes.remove(rightNode);
            Node parent = new Node(null, leftNode.weight + rightNode.weight);
            parent.left = leftNode;
            parent.right = rightNode;
            nodes.add(parent);
        }
        return nodes.get(0);
    }

    static HashMap<Byte, String> huffmanCode = new HashMap<>();

    public static void getCodes(Node huffmanTreeRoot) {
        StringBuilder stringBuilder = new StringBuilder();
        if (huffmanTreeRoot != null) {
            getCodes(huffmanTreeRoot.left, "0", stringBuilder);
            getCodes(huffmanTreeRoot.right, "1", stringBuilder);
        } else {
            System.out.println("赫夫曼树根节点为空~");
        }
    }

    public static void getCodes(Node node, String code, StringBuilder builder) {
        StringBuilder stringBuilder = new StringBuilder(builder);
        if (node != null) {
            stringBuilder.append(code);
            if (node.data != null) {
                huffmanCode.put(node.data, stringBuilder.toString());
            }
            getCodes(node.left, "0", stringBuilder);
            getCodes(node.right, "1", stringBuilder);
        }

    }

    public static byte[] zip(byte[] bytes, Map<Byte, String> huffmanCodes) {
        StringBuilder builder = new StringBuilder();
        for (byte b : bytes) {
            builder.append(huffmanCodes.get(b));
        }
        int len = (builder.length() + 7) / 8;
        byte[] zipByte = new byte[len];
        int index = 0;
        String str;
        for (int i = 0; i < builder.length(); i += 8) {
            if (i + 8 <= builder.length()) {
                str = builder.substring(i, i + 8);
            } else {
                str = builder.substring(i);
            }
            byte b = (byte) Integer.parseInt(str, 2);
            zipByte[index++] = b;
        }
        return zipByte;
    }

}

class Node implements Comparable<Node> {
    public Byte data;
    public int weight;
    public Node left;
    public Node right;

    public Node(Byte data, int weight) {
        this.data = data;
        this.weight = weight;
    }

    @Override
    public int compareTo(Node o) {
        return this.weight - o.weight;
    }

}