霍夫曼编码与解码源程序java版

首先是一个简单的排序import java.util.*;public class Heap ArrayList list = new ArrayList();public Heap()public Heap(E objects)for(int i = 0;i 0)if(list.get(currentIndex).compareTo(list.get(currentIndex - 1) 0)E temp = list.get(currentIndex);list.set(currentIndex, list.get(currentIndex - 1);list.set(currentIndex - 1, temp);else break;currentIndex -;public E remove()/删除并返回最小的一个数据if(list.size() = 0)return null;E returnObject = list.get(0);for(int i = 0; i list.size() - 1; i +)list.set(i,list.get(i + 1);list.remove(list.size() - 1);return returnObject;int getSize()return list.size();主要的程序import java.util.*;public class HuffmanCode Scanner input = new Scanner(System.in);int counts = new int256;/各个字符的权重String transferMsg = new String();/编码后的字符串String decipherMsg = new String();/解码后的字符串String codes;public HuffmanCode()/System.out.println(选择何种权重值？n.); useDefaultHuffmanTree();Tree tree = getHuffmanTree(counts);codes = getCodes(tree.root);System.out.print(输出从a开始的字符的各个编码：n);for(int i = 0;i codes.length;i +)if(countsi != 0)System.out.print(codesi + );if(i % 5 = 0)System.out.print(n);System.out.print(n);System.out.println(请输入要编码的字符串);String text = input.nextLine();/待编码的字符串System.out.print(输出输入字符串的huffman编码n);for(int i = 0;i text.length();i +)System.out.print(codes(int)text.charAt(i);transferMsg += codes(int)text.charAt(i);decipherTMsg();System.out.print(n解码后的文本： + decipherMsg);private void decipherTMsg() /解码/ TODO Auto-generated method stubint j = 0;for(int i = 0;i transferMsg.length();i += j)for(j = 1;j 26;j +)if(decipher(transferMsg.substring(i,i+j)break;private boolean decipher(String substring) / TODO Auto-generated method stubfor(int i = 0;i 256;i +)if(substring.equals(codesi)decipherMsg += (char)i;return true;return false;private void useDefaultHuffmanTree()/各个字符的权重countsa = 1859;countsb = 642;countsc = 218;countsd = 317;countse = 1031;countsf = 208;countsg = 152;countsh = 467;countsi = 575;countsj = 8;countsk = 49;countsl = 321;countsm = 198;countsn = 574;countso = 632;countsp = 152;countsq = 8;countsr = 484;countss = 514;countst = 796;countsu = 228;countsv = 83;countsw = 175;countsx = 13;countsy = 164;countsz = 5;private String getCodes(Tree.Node root) /从huffman树获得各个字符的编码/ TODO Auto-generated method stubif(root = null)return null;String codes = new String256;assignCode(root,codes);return codes;private void assignCode(Tree.Node root, String codes) /为各个字符编码/ TODO Auto-generated method stubif(root.left != null)root.left.code = root.code + 0;assignCode(root.left,codes);root.right.code = root.code + 1;assignCode(root.right,codes);elsecodes(int)root.element = root.code;private Tree getHuffmanTree(int counts) /构造霍夫曼树/ TODO Auto-generated method stubHeap heap = new Heap();for(int i = 0;i 1)Tree t1 = heap.remove();Tree t2 = heap.remove();heap.add(new Tree(t1,t2);return heap.remove();public static class Tree implements Comparable/树节点Node root;public Tree(Tree t1,Tree t2)/构建中间节点root = new Node();root.left = t1.root;root.right = t2.root;root.weight = t1.root.weight + t2.root.weight;public Tree(int weight,char element)root = new Node(weight,element);Overridepublic int compareTo(Tree o) / TODO Auto-generated method stubif(root.weight o.root.weight)return 1;if(root.weight o.root.weight)return -1;return 0;public class Node/内部类，存储树节点的相关信息char element;int weight;Node left;Node right;String code = ;public Node()public Node(int weight,char element)this.weight = weight;this.element = el