霍夫曼編碼與解碼源程序java版.doc

《霍夫曼編碼與解碼源程序java版.doc》由會(huì)員上傳分享，免費(fèi)在線閱讀，更多相關(guān)內(nèi)容在行業(yè)資料-天天文庫。

1、首先是一個(gè)簡單的排序importjava.util.*;publicclassHeap{ArrayListlist=newArrayList();publicHeap(){}publicHeap(E[]objects){for(inti=0;i

2、rentIndex=list.size()-1;while(currentIndex>0){if((list.get(currentIndex)).compareTo(list.get(currentIndex-1))<0){Etemp=list.get(currentIndex);list.set(currentIndex,list.get(currentIndex-1));list.set(currentIndex-1,temp);}elsebreak;currentIndex--;}}publicEre

3、move()//刪除并返回最小的一個(gè)數(shù)據(jù){if(list.size()==0)returnnull;EreturnObject=list.get(0);for(inti=0;i

4、ode{Scannerinput=newScanner(System.in);int[]counts=newint[256];//各個(gè)字符的權(quán)重StringtransferMsg=newString();//編碼后的字符串StringdecipherMsg=newString();///解碼后的字符串String[]codes;publicHuffmanCode(){//System.out.println("選擇何種權(quán)重值？.");useDefaultHuffmanTree();Treetree=get

5、HuffmanTree(counts);codes=getCodes(tree.root);System.out.print("輸出從a開始的字符的各個(gè)編碼：");for(inti=0;i

6、ngtext=input.nextLine();//待編碼的字符串System.out.print("輸出輸入字符串的huffman編碼");for(inti=0;i

7、oiddecipherTMsg(){//解碼//TODOAuto-generatedmethodstubintj=0;for(inti=0;i

8、+){if(substring.equals(codes[i])){decipherMsg+=(char)i;returntrue;}}returnfalse;}privatevoiduseDefaultHuffmanTree()//各個(gè)字符的權(quán)重{counts['a']=1859;counts['b']=642;counts['c']=218;counts['d']=317;counts['e']