我正在编程huffman编码。这是我的程序的开始:优先级队列错误顺序
using namespace std;
//Counting methods
int *CountCharOccurence(string text)
{
int *charOccurrence = new int[127];
for(int i = 0; i < text.length(); i++)
{
charOccurrence[text[i]]++;
}
return charOccurrence;
}
void DisplayCharOccurence(int *charOccurrence)
{
for(int i = 0; i < 127; i++)
{
if(charOccurrence[i] > 0)
{
cout << (char)i << ": " << charOccurrence[i] << endl;
}
}
}
//Node struct
struct Node
{
public:
char character;
int occurrence;
Node(char c, int occ) {
character = c;
occurrence = occ;
}
bool operator < (const Node* node)
{
return (occurrence < node->occurrence);
}
};
void CreateHuffmanTree(int *charOccurrence)
{
priority_queue<Node*, vector<Node*> > pq;
for(int i = 0; i < 127; i++)
{
if(charOccurrence[i])
{
Node* node = new Node((char)i, charOccurrence[i]);
pq.push(node);
}
}
//Test
while(!pq.empty())
{
cout << "peek: " << pq.top()->character << pq.top()->occurrence << endl;
pq.pop();
}
}
int main(int argc, char** argv) {
int *occurrenceArray;
occurrenceArray = CountCharOccurence("SUSIE SAYS IT IS EASY");
DisplayCharOccurence(occurrenceArray);
CreateHuffmanTree(occurrenceArray);
return (EXIT_SUCCESS);
}
该程序首先输出字符与他们的发生号码。这看上去很好:
: 4 A: 2 E: 2 I: 3 S: 6 T: 1 U: 1 Y: 2
但测试环路,其具有显示在优先级顺序输出该节点内容:
peek: Y2 peek: U1 peek: S6 peek: T1 peek: I3 peek: E2 peek: 4 peek: A2
这不是预期的顺序。为什么?
Tnx,现在有效。我现在编程了一段时间,但我刚接触C++。我不得不说越好,你越懂得语言就越爱你。但我认为开始很难。 – TheArchitect