Java实现Huffman编码的示例代码

public class Node {
	//编码字符
    private char data;
    //频次
    private int freq;
    //左子节点
    private Node left;
    //右子节点
    private Node right;
}

public static void main(String[] args) {
        char[] charArray = { 'a', 'b', 'c', 'd', 'e', 'f' };
        int[] charFreq = { 45, 13, 12, 16, 9, 5 };
        PriorityQueue<Node> priorityQueue = new PriorityQueue<>(6, new Comparator<Node>() {
            @Override
            public int compare(Node o1, Node o2) {
                return o1.getFreq() - o2.getFreq();
            }
        });
        for (int i = 0; i < 6; i++) {
            Node node = new Node();
            node.setData(charArray[i]);
            node.setFreq(charFreq[i]);
            priorityQueue.add(node);
        }
        Node root = null;
        while (priorityQueue.size() > 1) {
            Node newNode = new Node();
            Node left = priorityQueue.peek();
            newNode.setLeft(left);
            priorityQueue.poll();
            Node right = priorityQueue.peek();
            newNode.setRight(right);
            priorityQueue.poll();
            newNode.setFreq(left.getFreq() + right.getFreq());
            root = newNode;
            priorityQueue.add(newNode);
        }
        printCode(root, "");
    }
    public static void printCode(Node root, String code) {
        if (root.getLeft() == null && root.getRight() == null && Character.isLetter(root.getData())) {
            System.out.println(root.getData() + ": " + code);
            return;
        }
        printCode(root.getLeft(), code + "0");
        printCode(root.getRight(), code + "1");
    }
	//运行结果
	//a: 0
	//c: 100
	//b: 101
	//f: 1100
	//e: 1101
	//d: 111