队列_笔记

与栈类似但规则不一样，栈是先进后出只有一个口，队列是两个口规则先进先出一个口只能进，一个口只能出

.h

#define MAX_SIZE 1024

//顺序队列结构体
typedef struct SEQQUEUE
{
    void *data[MAX_SIZE];
    int size;
}SeqQueue;

class Queue
{
public:
    Queue();
    ~Queue();

public:
    SeqQueue* queue;

public:
    //入队
    void Push_Queue(SeqQueue* queue,void *data);
    //返回对头元素
    void* Front_Queue(SeqQueue* queue);
    //出队
    void Pop_Queue(SeqQueue* queue);
    //返回队尾元素
    void* Back_Queue(SeqQueue* queue);
    //返回大小
    int Size_Queue(SeqQueue* queue);
    //清空
    void Clear_Queue(SeqQueue* queue);



};

.cpp

Queue::Queue()
{
    queue = new SeqQueue();
    for (int i = 0; i < MAX_SIZE; i++)
    {
        queue->data[i] = NULL;
    }
    queue->size = 0;
}

Queue::~Queue()
{
    if (queue == NULL)
    {
        return;
    }

    delete queue;

}

//入队
void Queue::Push_Queue(SeqQueue* queue, void *data)
{
    if (queue == NULL || data == NULL || queue->size == MAX_SIZE)
    {
        return;
    }


    //数组左边当做队头
    queue->data[queue->size] = data;
    queue->size++;
}

//返回对头元素
void* Queue::Front_Queue(SeqQueue* queue)
{
    if (queue == NULL || queue->size == 0)
    {
        return NULL;
    }


    return queue->data[0];
}

//出队
void Queue::Pop_Queue(SeqQueue* queue)
{
    if (queue == NULL || queue->size == 0)
    {
        return ;
    }

    //需要移动元素
    for (int i = 0; i < queue->size -1; i++)
    {
        queue->data[i] = queue->data[i + 1];
    }
    queue->size--;
}

//返回队尾元素
void* Queue::Back_Queue(SeqQueue* queue)
{
    if (queue == NULL || queue->size == 0)
    {
        return NULL;
    }
    return queue->data[queue->size -1];
}

//返回大小
int Queue::Size_Queue(SeqQueue* queue)
{
    if (queue == NULL )
    {
        return -1;
    }

    return queue->size;
}

//清空
void Queue::Clear_Queue(SeqQueue* queue)
{
    if (queue == NULL)
    {
        return;
    }

    queue->size = 0;
}

main.cpp

typedef struct PERSON
{
    char name[64];
    int age;
}Person;

int main()
{
    Queue* q = new Queue();

    //创建数据
    Person p1 = { "p1",10 };
    Person p2 = { "p2",20 };
    Person p3 = { "p3",30 };
    Person p4 = { "p4",40 };
    Person p5 = { "p5",50 };

    //数据入队列
    q->Push_Queue(q->queue, &p1);
    q->Push_Queue(q->queue, &p2);
    q->Push_Queue(q->queue, &p3);
    q->Push_Queue(q->queue, &p4);
    q->Push_Queue(q->queue, &p5);

    //输出对尾元素
    Person* BackPerson = (Person*)q->Back_Queue(q->queue);
    cout << "Name:" << BackPerson->name << " ";
    cout << "Age:" << BackPerson->age<<" ";
    cout<< endl<<endl;


    //输出
    while (q->Size_Queue(q->queue)>0)
    {
        //取出对头元素
        Person *p = (Person*)q->Front_Queue(q->queue);

        cout << "Name:" << p->name << " ";
        cout << "Age:" << p->age << " ";
        cout << endl;

        //弹出元素
        q->Pop_Queue(q->queue);
    }



    return 0;
}