封装一个循环顺序队列，并封装其相应的操作:判空、入队列、出队、遍历队、求队列长度、销毁（C++)

封装一个循环顺序队列，并封装其相应的操作:判空、入队列、出队、遍历队、求队列长度、销毁
 

头文件

#ifndef HEAD_H
#define HEAD_H

#define Max 20

class Loopseque{
private:
    int *data;
    int head;
    int tail;
public:
    //创建
    void seque_create();
    //判空
    bool seque_empty();
    //判满
    bool seque_full();
    //入队
    void seque_insert();
    //出队
    void seque_out();
    //遍历
    void seque_show();
    //求队列长度
    void seque_length();
    //销毁
    void seque_delete();
};


#endif // HEAD_H

源文件

#include <iostream>
#include <head.h>
using namespace std;

//创建
void Loopseque::seque_create(){
    data = new int[Max];
    head = 0;
    tail = 0;
}

//判空
bool Loopseque::seque_empty(){
    return head==tail;
}

//判满
bool Loopseque::seque_full(){
    return (tail+1)%Max == head;
}

//入队
void Loopseque::seque_insert(){
    if(seque_full()){
        cout<<"队列已满，入队失败"<<endl;
        return;
    }
    int num;
    cout<<"请输入要入队的数：";
    cin>>num;
    data[tail] = num;
    tail = (tail+1)%Max;
}

//出队
void Loopseque::seque_out(){
    if(seque_empty()){
        cout<<"队列已空，出队失败"<<endl;
        return;
    }
    cout << data[head] <<"出队成功" <<endl;
    head = (head+1)%Max;
}

//遍历
void Loopseque::seque_show(){
    if(seque_empty()){
        cout<<"队列已空，遍历失败"<<endl;
        return;
    }
    for(int i = head ; i!=tail;i=(i+1)%Max){
        cout<<data[i]<<' ';
    }
    cout<<endl;
}

//求队列长度
void Loopseque::seque_length(){
    if(seque_empty()){
        cout<<"队列已空，求队列长度失败"<<endl;
        return;
    }
    cout << "队列长度 = " << (tail+Max-head)%Max << endl;
}

//销毁
void Loopseque::seque_delete(){
    delete []data;
    data = nullptr;
    cout<<"销毁成功"<<endl;
}

 主调函数

#include <iostream>
#include <head.h>

using namespace std;

int main()
{
    Loopseque ls;
    //创建
    ls.seque_create();
    //创建后遍历
    ls.seque_show();
    //入队
    ls.seque_insert();
    ls.seque_insert();
    ls.seque_insert();
    //入队后遍历
    ls.seque_show();
    //求队列长度
    ls.seque_length();
    //出队
    ls.seque_out();
    ls.seque_out();
    //出队后第一次遍历
    ls.seque_show();
    //出队
    ls.seque_out();
    //最终遍历
    ls.seque_show();
    //销毁
    ls.seque_delete();

    return 0;
}

运行结果