队列的C++实现

朴灿烈づ我的快乐病毒、 2024-04-01 12:39 43阅读 0赞

#include <iostream>
    #include <string>
    using namespace std;
    
    template <typename T>
    class Myqueue
    {
    private:
        int front;   //头元素下标
        int rear;    //尾元素下标
        int maxSize; //队列总空间大小
        T *array;
    
    public:
        Myqueue(int size = 10) //构造函数
        {
            front = 1;
            rear = 0;
            maxSize = size + 1;
            array = new T[maxSize];
        }
    
    
        T back()
        {
            if (empty())
            {
                cout << "队列为空" << endl;
                return NULL;
            }
            return array[rear];
        }
    
    
        bool empty()
        {
            if (size() == 0)
                return true;
            return false;
        }
    
    
        T frontValue()
        {
            if (empty())
            {
                cout << "队列为空" << endl;
                return NULL;
            }
            else
            {
                return array[front];
            }
        }
    
        void pop()
        {
            if (empty())
                cout << "队列已经为空" << endl;
            else
                front = (front + 1) % maxSize;
        }
    
    
        void push(T value)
        {
            if (size() == maxSize - 1)
            {
                cout << "队列已满，无法继续添加元素" << endl;
            }
            else
            {
                rear = (rear + 1) % maxSize;
                array[rear] = value;
            }
        }
    
        int size()
        {
            return (rear + maxSize - front + 1) % maxSize;
        }
    };
    
    int main()
    {
        Myqueue<string> q(5);
        q.push("abc");
        q.push("def");
        q.push("ghi");
        q.push("jkl");
        q.push("mno");
        q.push("pqr");
        int len = q.size();
        cout << q.back() << endl;
        for (int i = 0; i < len; i++)
        {
            cout << q.frontValue() << endl;
            q.pop();
        }
        cout << q.empty() << endl;
        return 0;
    }

参考：

[数据结构图文解析之：队列详解与C++模板实现 - melonstreet - 博客园][C_ - melonstreet -]

[C++ 队列的实现\_Slatter的博客-CSDN博客\_队列c++实现][C_ _Slatter_-CSDN_c]

[C_ - melonstreet -]: https://www.cnblogs.com/QG-whz/p/5171123.html
[C_ _Slatter_-CSDN_c]: https://blog.csdn.net/Slatter/article/details/107569364?spm=1001.2101.3001.6650.6&utm_medium=distribute.pc_relevant.none-task-blog-2~default~BlogCommendFromBaidu~Rate-6-107569364-blog-104784493.pc_relevant_3mothn_strategy_and_data_recovery&depth_1-utm_source=distribute.pc_relevant.none-task-blog-2~default~BlogCommendFromBaidu~Rate-6-107569364-blog-104784493.pc_relevant_3mothn_strategy_and_data_recovery&utm_relevant_index=9