java 删除后缀txt_HuffmanPro.java下载后请去掉txt后缀

();

/*多余

public char[] getLetter() {

return letter;

}

public void setLetter() {

this.letter = letter;

}

public int[] getWeight() {

return weight;

}

public void setWeight(int[] weight) {

this.weight = weight;

}

*/

//用一个HuffmanNode最小堆(Java可用现成的最优队列)帮助建立HuffmanTree;

public void creatHuffmanTree(){

//将基本元素加入优先队列

for(int i=0;iHuffmanNode tempHuffmanNode = new HuffmanNode(

weightList.get(i) , letterList.get(i));

nodePriorityQueue.add(tempHuffmanNode);

}

HuffmanNode tempLeftHuffmanNode = null;

HuffmanNode tempRightHuffmanNode = null;

HuffmanNode tempParentHuffmanNode = null;

while( nodePriorityQueue.size()!=1 ){

tempLeftHuffmanNode = nodePriorityQueue.poll();

tempRightHuffmanNode = nodePriorityQueue.poll();

tempParentHuffmanNode = new HuffmanNode(

tempLeftHuffmanNode.getWeight()+tempRightHuffmanNode.getWeight());

//设置节点指向

tempParentHuffmanNode.setLeftChildNode(tempLeftHuffmanNode);

tempParentHuffmanNode.setRightChildNode(tempRightHuffmanNode);

tempLeftHuffmanNode.setParentNode(tempParentHuffmanNode);

tempRightHuffmanNode.setParentNode(tempParentHuffmanNode);

//父节点放入优先队列

nodePriorityQueue.add(tempParentHuffmanNode);

}

huffmanRootNode = nodePriorityQueue.poll();

code(huffmanRootNode);

}

public

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值