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

首先是一个简单的排序 import java.util.*; public class Heap E extends Comparable{ ArrayListE list = new ArrayListE(); public Heap() { } public Heap(E[] objects) { for(int i = 0;i objects.length;i ++) add(objects[i]); } public void add(E newObject)//添加数据时自动按照从小到大的顺序排列 { list.add(newObject); int currentIndex = list.size() - 1; while(currentIndex 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 int[256];//各个字符的权重 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(counts[i] != 0){ System.out.print(codes[i] + ); 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 stub int j = 0; for(int i = 0;i transferMsg.length();i