#include <iostream>
#include <cstdlib>
#include <string>
using namespace std;
class Customer
{
public:
??? Customer(string name,int age);
??? Customer();
??? void printInfo()const;
private:
??? string m_strName;
??? int m_iAge;
};
Customer::Customer(string name, int age)
{
?m_strName = name;
?m_iAge = age;
}
Customer::Customer()
{
??? m_strName = "null";
??? m_iAge = 0;
}
void Customer::printInfo()const
{
??? cout<<m_strName<<" : "<<m_iAge<<endl;
}

class Queue
{
private:
??? Customer* m_pQueue;????????? //隊(duì)列數(shù)組指針
??? int m_iQueueLen;?????????? //隊(duì)列數(shù)組長度
??? int m_iQueueCapacity;????? //隊(duì)列數(shù)組容量
??? int m_iHead;
??? int m_iTail;

public:
??? Queue(int queueCapacity)//創(chuàng)建隊(duì)列
??? {
??????? m_pQueue = new Customer[m_iQueueCapacity];
??????? ClearQueue();
??????? m_iQueueCapacity = queueCapacity;

??? }
??? virtual ~Queue()????????? //銷毀隊(duì)列
??? {
??????? delete []m_pQueue;
??????? m_pQueue = NULL;
??? }
??? void ClearQueue()???????? //清空隊(duì)列
??? {
??????? m_iHead = 0;
??????? m_iTail = 0;
??????? m_iQueueLen = 0;
??? }
??? bool QueueEmpty() const?? //判空隊(duì)列
??? {
??????? if(m_iQueueLen == 0){
??????????? return true;
??????? }
??????? else return false;
??? }
??? bool QueueFull() const??? //判斷是否為滿
??? {
??????? if(m_iQueueLen == m_iQueueCapacity){
??????????? return true;
??????? }
??????? else return false;
??? }
??? int QueueLength() const?? //隊(duì)列長度
??? {
??????? return m_iQueueLen;
??? }
??? bool EnQueue(Customer element) //新元素入列
??? {
??????? if(QueueFull())
??????? {
??????????? return false;
??????? }
??????? else
??????? {
??????????? m_pQueue[m_iTail] = element;
??????????? m_iTail++;
??????????? m_iQueueLen++;
??????????? m_iTail = m_iTail % m_iQueueCapacity;
??????????? return true;
??????? }
??? }
??? bool DeQueue(Customer &element)//首元素出列
??? {
??????? if(QueueEmpty())
??????? {
??????????? return false;
??????? }
??????? else
??????? {
??????????? element = m_pQueue[m_iHead];
??????????? m_iHead++;
??????????? m_iQueueLen--;
??????????? return true;
??????? }
??? }
??? void QueueTraverse()????? //遍歷隊(duì)列
??? {
??????? for(int i = m_iHead;i < m_iQueueLen + m_iHead;i++)
??????? {
??????????? cout << "前面還有" << (i-m_iHead) << "個人" <<endl;
??????????? m_pQueue[i % m_iQueueCapacity].printInfo();
??????? }
??? }

};
int main()
{
??? Queue *p = new Queue(4);
??? Customer c1("Letme",1);
??? Customer c2("Uzi",2);
??? Customer c3("Ming",3);
??? Customer c4("Mlxg",4);
??? p->EnQueue(c1);
??? cout<<"?"<<endl;
??? p->EnQueue(c2);
??? p->EnQueue(c3);
??? p->EnQueue(c4);
??? p->QueueTraverse();
??? return 0;
}

這段代碼的遍歷和其他都沒問題，但是往里面加數(shù)據(jù)時無法成功加入