/*** @param code - 字符集* @param weight - 频数*/public void create(char[] code,double[] weight) {num=code.length;   //获取字符集字符总数node_tot=2*num-1;  //总共需要2num－1个节点PriorityQueue<HTNode> Q = new PriorityQueue<HTNode>();   //优先队列排序HT=new HTNode[node_tot+1];HT[0]=new HTNode(0);//给叶子结点赋值for(int i=1;i<=num;i++) {HT[i]=new HTNode(i,code[i-1],weight[i-1]);Q.add(HT[i]);}int id=num;//Huffman编码while(Q.size()>=2) {//找到两个权值最小的结点作为左右子树的根节点构造新的二叉树。HTNode s1=Q.remove();HTNode s2=Q.remove();id++;//创建新的节点//新节点的权值是两个子节点之和HT[id]=new HTNode(id,s1,s2);     s1.parent=s2.parent=id;        //将两个子节点的父节点设置为 id;//新节点重新放入队列Q.add(HT[id]);}}

/*** 从叶子到根逆向求每个字符的Huffman编码*/public void createHuffmanCode() {int start,c,f;char[] cd=new char[num];HuffmanCodeList=new String[num+1]; //分配内存空间//依次对所有字符编码for(int i=1; i<=num; i++){start=num;//从叶子到根逆向求编码for(c=i,f=HT[i].parent;f!=-1;c=f,f=HT[f].parent) {if(HT[f].lchild==c) {cd[--start]='0';}else{cd[--start]='1';}}//复制编码到Huffman编码表HuffmanCodeList[i]=new String(cd,start,num-start);}}

/*** 从叶子到根逆向求每个字符的Huffman编码*/public void createHuffmanCode() {int start,c,f;char[] cd=new char[num];HuffmanCodeList=new String[num+1]; //分配内存空间//依次对所有字符编码for(int i=1; i<=num; i++){start=num;//从叶子到根逆向求编码for(c=i,f=HT[i].parent;f!=-1;c=f,f=HT[f].parent) {if(HT[f].lchild==c) {cd[--start]='0';}else{cd[--start]='1';}}//复制编码到Huffman编码表HuffmanCodeList[i]=new String(cd,start,num-start);}}

/*** @param code_str - 需要译码的字符串* @return encode - 完成Huffman译码的字符串*/public String deCode(String code_str) {int len=code_str.length();String decode=new String();String temp=new String();//依次与所有字符编码开始匹配for(int i=0;i<len;i++) {temp=temp+code_str.charAt(i);for(int j=1;j<=num;j++) {//匹配成功if(HuffmanCodeList[j].equals(temp)) {decode=decode+HT[j].code;temp="";break;}}if(temp.length()>128)return null;}if(!temp.equals(""))return null;return decode;}

FileDialog jf=new FileDialog(this,"选择文本文件",FileDialog.LOAD);jf.setVisible(true);String path=getAllPath(jf);if(path==null) {return;}String str=readFileToString(path);int len=str.length();char[] code = new char[128];double[] weight =new double[128];for(int i=0;i<128;i++) {code[i]=(char)i;}int num=0;for(int i=0;i<len;i++) {char ch=str.charAt(i);if(ch<0||ch>128) {JOptionPane.showMessageDialog(null, "文件读取错误", "错误提示",JOptionPane.ERROR_MESSAGE);return;}if(weight[ch]==0)num++;weight[ch]+=1;}char[] new_code = new char[num];double[] new_weight =new double[num];for(int i=0,j=0;i<128;i++) {if(weight[i]!=0.0) {new_code[j]=code[i];new_weight[j++]=weight[i];}}initHuffmanTree(new_code,new_weight,textArea,textArea_3);

/*** @param root HuffmanTree ROOT* @param g Graphics**/public void paintTree(int root,Graphics g,int x,int y){if(root!=-1){if(HT[root].code=='\0')g.drawString(new Double(HT[root].weight).toString(),x-10,y+10);elseg.drawString(chartoString(HT[root].code)+(new Double(HT[root].weight).toString()),x-10,y+10);if(HT[root].lchild!=-1||HT[root].rchild!=-1){int width=7*HT[root].leaf;g.drawLine(x, y+10, x-width, y+30);paintTree(HT[root].lchild, g,x-width,y+30);g.drawLine(x, y+10, x+width, y+30);paintTree(HT[root].rchild, g,x+width,y+30);}}}  网络通信
/*** @param port 监听端口* @param ta JTextArea对象* @throws IOException 如果发生I / O错误*/public void startReceive(int port,JTextArea ta) throws IOException{// TODO 自动生成的方法存根ssk = new ServerSocket(port);isStop=false;ssk.setSoTimeout(5*1000);new Thread(()-> {while(!isStop) {Socket sk=null;try {sk = ssk.accept();} catch (IOException e) {// TODO 自动生成的 catch 块e.printStackTrace();}new Thread(new ReceiveThread(sk,ta)).start();}try {ssk.close();} catch (IOException e) {// TODO 自动生成的 catch 块e.printStackTrace();}}).start();}

synchronized(ta) {if(destr==null)ta.append("Oh,My God! "+ip+" send a message but it isn\'t Huffman Code!"+"\r\n");elseta.append("Remote Host["+ip+"]:"+destr+"\r\n");}

Synchronized同步以解决多线程问题。