数据结构之环形队列应用（2）

实现：队列里存放每个顾客信息

#ifndef CUSTOMER_H
#define CUSTOMER_H
#include<string>
using namespace std;
class Customer
{
public:
    Customer(){}
    Customer(string name,int age);
    void printInfo()const;

private:
    string m_strName;
    int m_iAge;

};

#endif

#include<iostream>
#include "Customer.h"
using namespace std;
Customer::Customer(string name, int age) :m_strName(name), m_iAge(age){

}
void Customer::printInfo() const{
    cout << "姓名：" << m_strName << endl;
    cout << "年龄：" << m_iAge << endl;
    cout << endl;
}

#ifndef MYQUEUE_H
#define MYQUEUE_H
#include "Customer.h"
/*
    环形队列C++实现
*/
class MyQueue{
public:
    MyQueue(int queueCapacity);     //构造函数
    virtual ~MyQueue();
    void ClearQueue();
    bool QueueEmpty() const;
    bool QueueFull() const;
    int QueueLength() const;
    bool EnQueue(Customer element);
    bool DeQueue(Customer &element);
    void QueueTraverse();
private:
    Customer *m_pQueue;
    int m_iQueueLen;
    int m_iQueueCapacity;
    int m_iHead;
    int m_iTail;
};
#endif

#include "MyQueue.h"
#include<iostream>
#include "Customer.h"
using namespace std;

MyQueue::MyQueue(int queueCapacity){
    m_iQueueCapacity = queueCapacity;
    m_pQueue = new Customer[m_iQueueCapacity];//有可能申请失败
    ClearQueue();
}

MyQueue::~MyQueue(){
    delete[]m_pQueue;
    m_pQueue = nullptr;


}
void MyQueue::ClearQueue(){
    m_iHead = 0;
    m_iTail = 0;
    m_iQueueLen = 0;
}

bool MyQueue::QueueEmpty() const{
    return m_iQueueLen == 0 ? true : false;
}

int MyQueue::QueueLength() const{
    return m_iQueueLen;
}

bool MyQueue::QueueFull() const{
    if (m_iQueueLen == m_iQueueCapacity)
        return true;
    return false;
}
bool MyQueue::EnQueue(Customer element){
    if (QueueFull())
        return false;
    m_pQueue[m_iTail] = element;
    m_iTail++;
    m_iQueueLen++;
    m_iTail %= m_iQueueCapacity;
    return true;
}

bool MyQueue::DeQueue(Customer &element){
    if (QueueEmpty())
        return false;
    element = m_pQueue[m_iHead];
    m_iHead++;
    m_iQueueLen--;
    m_iHead %= m_iQueueCapacity;
    return true;
}

void MyQueue::QueueTraverse(){

    for (int i = m_iHead; i < m_iQueueLen + m_iHead; i++){
        m_pQueue[i%m_iQueueCapacity].printInfo();
        cout << "前面还有" << (i - m_iHead) << "人" << endl;
    }
    cout << endl;
}

#include<iostream>
#include "MyQueue.h"
#include "Customer.h"
using namespace std;

int main(){
    MyQueue *p = new MyQueue(4);
    Customer c1("zhangsan", 20);
    Customer c2("lisi", 30);
    Customer c3("xiaohong", 40);

    p->EnQueue(c1);
    p->EnQueue(c2);
    p->EnQueue(c3);
    p->QueueTraverse();

    Customer c4("", 0);
    p->DeQueue(c4);
    c4.printInfo();

    p->QueueTraverse();

    delete p;
    p = NULL;
    return 0;
}