【发布时间】:2014-03-09 18:19:59
【问题描述】:
我有一个处理霍夫曼树的任务。我的教授提到我们应该使用 HashMap,但没有解释任何关于它们的内容。我已经查找了有关它们的信息,但在我的代码中遇到了它们的问题。这些是我收到的错误消息。
n00832607.java:542: error: incompatible types
for(Map.Entry e : charCounts.entrySet())
^
required: Entry
found: Object
n00832607.java:610: error: incompatible types
for(Map.Entry entry : codeTable.entrySet())
^
required: Entry
found: Object
所以我可以说它希望它返回一个条目,但我不确定如何处理这个问题。我应该把它当作某种东西吗?
这是我的代码。
//Beging Huffman Class
class Huffman{
Tree tree;
TreeMap codeTable;
protected HashMap calculateFrequency(String message)
{
int messageLength = message.length();
char ch;
int count;
HashMap charCounts = new HashMap();
for(int i = 0; i< messageLength; i++)
{
ch = message.charAt(i);
if(charCounts.containsKey(ch))
{
count = (int) charCounts.get(ch);
++count;
charCounts.put(ch, count);
}
else
{
charCounts.put(ch, 1);
}
}
//end for
return charCounts;
}
//end calculateFrequency
protected void createHuffmanTree(String message)
{
HashMap charCounts = calculateFrequency(message);
PriorityQueue trees = new PriorityQueue();
Tree temp;
for(Map.Entry e : charCounts.entrySet())
{
temp = new Tree((char)e.getKey(), (int)e.getValue());
trees.add(temp);
}
while(trees.size() > 1)
{
temp = new Tree((Tree)trees.remove(), (Tree)trees.remove());
trees.add(temp);
}
tree = (Tree)trees.remove();
}
//end createHuffmanTree
//Begin displayCodeTable
public void displayCodeTable()
{
System.out.println("Character Code");
for(Map.Entry entry : codeTable.entrySet())
{
char key = (char)entry.getKey();
System.out.println(key + "" + entry.getValue());
}
}
//End displayCodeTable
【问题讨论】:
标签: java encoding hashmap huffman-code