package lwm.algorithm.others;
public class HffManNode {
int weigth;
int parent,lchild,rchild;
public int getWeigth() {
return weigth;
}
public void setWeigth(int weigth) {
this.weigth = weigth;
}
public int getParent() {
return parent;
}
public void setParent(int parent) {
this.parent = parent;
}
public int getLchild() {
return lchild;
}
public void setLchild(int lchild) {
this.lchild = lchild;
}
public int getRchild() {
return rchild;
}
public void setRchild(int rchild) {
this.rchild = rchild;
}
}
package lwm.algorithm.others;
public class HffmanCode {
int s1=0,s2=0;//最小的权值的HffManNode的下标
public HffManNode[] InitialHT(int n,int[] weigth){
HffManNode[] hmn=new HffManNode[2*n];
for (int i=1;i<=n;i++){
HffManNode subhmn=new HffManNode();
subhmn.setWeigth(weigth[i-1]);
subhmn.setParent(0);
subhmn.setRchild(0);
subhmn.setLchild(0);
hmn[i]=subhmn;
}
for(int j=n+1;j<2*n-1;j++){
HffManNode subhmn=new HffManNode();
subhmn.setWeigth(0);
subhmn.setParent(0);
subhmn.setRchild(0);
subhmn.setLchild(0);
hmn[j]=subhmn;
}
return hmn;
}
public void setTwoMinNode(HffManNode[] hmn){
int i,j;
for(i=1;i<=hmn.length/2;i++)
if (hmn[i].parent==0){
s1=i;
break;
}
for(j=i;j<=hmn.length/2;j++)
if(hmn[j].parent==0){
s2=j;
break;
}
for(i=1;i<=hmn.length/2;i++){
if (hmn[s1].weigth>hmn[i].weigth&&(hmn[i].parent==0)&&s1!=i)s1=i;
}
for(j=1;j<=hmn.length/2;j++){
if(hmn[s2].weigth>hmn[j].weigth&&(hmn[j].parent==0)&&s2!=j)s2=j;
}
}
public void HFMCode(HffManNode[] hmn,int n,int[] weigh){
hmn=InitialHT(n,weigh);
for(int i=hmn.length+1;i<=(2*hmn.length-1);i++){
setTwoMinNode(hmn);
hmn[s1].parent=i;
hmn[s2].parent=i;
hmn[i].lchild=s1;
hmn[i].rchild=s2;
hmn[i].weigth=hmn[s1].weigth+hmn[s2].weigth;
}
}
}