霍夫曼編碼與解碼源程序java版講課教案.doc

《霍夫曼編碼與解碼源程序java版講課教案.doc》由會員上傳分享，免費在線閱讀，更多相關內(nèi)容在工程資料-天天文庫。

1、霍夫曼編碼與解碼源程序java版精品文檔首先是一個簡單的排序importjava.util.*;publicclassHeap{ArrayListlist=newArrayList();publicHeap(){}publicHeap(E[]objects){for(inti=0;i

2、);intcurrentIndex=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--;}}publicEremove

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

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

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

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

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

8、ls(codes[i])){decipherMsg+=(char)i;returntrue;}}returnfalse;}privatevoiduseDefaultHuffmanTree()//各個字符的權(quán)重{counts['a']=