在C++中建立动态队列

making a dynamic queue in C++

本文关键字:动态 队列 建立 C++      更新时间:2023-10-16

我正在尝试在C++中创建一个动态队列,我编写了大部分代码,但它不起作用,有人可以好心地查看它并告诉我出了什么问题吗? :)另外,请评论我希望改进的编码风格。

我写了一个 main 函数来测试程序,这应该是预期的结果:

数据1=1

数据

1=1 数据2=2

1 2 3 4 5 6

Del:

1 Del:2 Del:3

这是我的代码:

#include <iostream>
template<typename T>
class Queue
{
    struct Node
    {
        T data;
        Node* next;
    };
    Node* head;
    Node* tail;
    int qsize;
public:
    Queue()
    {
        head = NULL;
        tail = NULL;
        qsize = 0;
    }
    bool empty()
    {
        if(qsize = 0){return true;}
        else         {return false;}
    }
    void put(const T& data)
    {    
        Node *newNode = new Node;
        if(qsize)
        {
            tail->next = newNode;
            newNode->data = data;
            newNode->next = NULL;
            tail = newNode;
        }
        else
        {
            head = tail = newNode;
            newNode->data = data;
            newNode->next = NULL;
        }
        qsize++;
    }
    T get()
    {
        T val;
        Node *temp;
        if(empty())
        {
            std::cout << "queue is empty" << std::endl;
        }
        else
        {
            val = head->data;
            temp = head;
            head = head->next;
            delete temp;
            qsize--;
            return val;
        }
    }
    void destroyQueue()
    {
        while(!empty())
        {
            std::cout<<"DEL:";
            get();
        }
    }
    ~Queue()
    {
        destroyQueue();
    }
};

int main()
{
    int data1,data2;
    Queue<int>* q = new Queue<int>();
    q->put(1);
    data1 = q->get();
    std::cout << " data1=" << data1 << std::endl;
    q->put(1);
    q->put(2);
    data1 = q->get();
    data2 = q->get();
    std::cout << " data1=" << data1
              << " data2=" << data2 << std::endl;
    q->put(1);
    q->put(2);
    q->put(3);
    q->put(4);
    q->put(5);
    q->put(6);
    while (!q->empty()) std::cout << " " << q->get();
    std::cout << std::endl;
    q->put(1);
    q->put(2);
    q->put(3);
    delete q;
}

if(qsize = 0)应该if(qsize == 0) - 不要分配,比较!