数据结构-顺序队列

原创已于 2023-03-30 12:31:03 修改 · 280 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#数据结构

于 2016-12-01 15:35:15 首次发布

c++ 同时被 2 个专栏收录

59 篇文章

订阅专栏

数据结构

9 篇文章

订阅专栏

本文介绍了一个通用的序列队列类的实现，该类使用模板来处理不同数据类型的元素，并提供了基本的操作如入队、出队等。通过示例展示了如何初始化序列队列并进行操作。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

// seq_queue.h
#ifndef SEQ_QUEUE_H
#define SEQ_QUEUE_H

#include <iostream>

template<typename Type> class Sequence_queue
{
public:
    Sequence_queue(int size) : m_front(0), m_rear(0), m_count(0), m_maxsize(size)
    {
        m_elements = new Type[size];
        if(m_elements == NULL)
        {
            std::cout << __FUNCTION__ << " application error " << std::endl;
            exit(1);
        }
    }
    ~Sequence_queue()
    {
        delete[] m_elements;
    }
public:
    void MakeEmpty();
    bool IsEmpty();
    bool IsFull();
    bool EnQueue(const Type item);
    Type DeQueue();
    Type GetData();
    void Print();

private:
    int m_front;
    int m_rear;
    int m_count;
    int m_maxsize;
    Type *m_elements;
};

template<typename Type> void Sequence_queue<Type>::MakeEmpty()
{
    m_count = 0;
    m_front = 0;
    m_rear = 0;
}

template<typename Type> bool Sequence_queue<Type>::IsEmpty()
{
    return (m_count == 0);
}

template<typename Type> bool Sequence_queue<Type>::IsFull()
{
    return (m_count == m_maxsize);
}

template<typename Type> bool Sequence_queue<Type>::EnQueue(const Type item)
{
    if(IsFull())
    {
        std::cout << __FUNCTION__ << " error : queue is full " << std::endl;
        return 0;
    }
    m_elements[m_rear] = item;
    m_rear = (m_rear + 1) % m_maxsize;
    m_count++;
    return 1;
}

template<typename Type> Type Sequence_queue<Type>::DeQueue()
{
    if(IsEmpty())
    {
        std::cout << __FUNCTION__ << " error : queue is empty " << std::endl;
        return 0;
    }
    Type tmp = m_elements[m_front];
    m_front = (m_front + 1) % m_maxsize;
    m_count--;
    return tmp;
}

template<typename Type> Type Sequence_queue<Type>::GetData()
{
    if(IsEmpty())
    {
        std::cout << __FUNCTION__ << " error : queue is empty " << std::endl;
        return 0;
    }
    return m_elements[m_front];
}

template<typename Type> void Sequence_queue<Type>::Print()
{
    std::cout << "front";
    for(int i = 0; i < m_count; i++)
    {
        std::cout << "--->" << m_elements[(m_front + i + m_maxsize) % m_maxsize];
    }
    std::cout << "--->rear" << std::endl << std::endl << std::endl;
}



#endif // SEQ_QUEUE_H

// main.cpp
#include <iostream>
#include "seq_queue.h"

using namespace std;

int main(int argc, char *argv[])
{
    Sequence_queue<int> queue(10);
    int init[10] = {1, 3, 5, 7, 9, 11, 13,15, 17, 19};
    for(int i = 0; i< 10; i++)
    {
        queue.EnQueue(init[i]);
    }
    queue.Print();

    cout << queue.DeQueue() << endl;
    queue.Print();

    for(int i = 5; i < 10; i++)
    {
        queue.EnQueue(init[i]);
    }
    queue.Print();

    cout << queue.GetData() << endl;

    queue.MakeEmpty();
    queue.Print();

    queue.EnQueue(1);
    queue.Print();
    return 0;
}