#include "stdafx.h"

#include<iostream>

using namespace std;

class Myqueue//建立一個(gè)環(huán)形隊(duì)列的對(duì)象的方法

{

? ? public:

Myqueue(int queueCapacity);//創(chuàng)建隊(duì)列

virtual ~Myqueue();//銷毀隊(duì)列

void clearqueue();//清空隊(duì)列

bool queueempty()const;//判空隊(duì)列檢測(cè)

bool queuefill()const;//判滿隊(duì)列檢測(cè)

int queuelength();//隊(duì)列的長(zhǎng)度

bool enqueue(int element);//新元素進(jìn)隊(duì)

bool dequeue(int &element);//首元素出隊(duì)

void queuetraverse();///*遍歷隊(duì)列

? ? private:

int *m_pqueue;//隊(duì)列數(shù)組指針

int m_iqueue;//隊(duì)列元素個(gè)數(shù)

int m_iqueuecapacity;//隊(duì)列數(shù)組容量*/

int m_iHead;

int m_itail;

}

//創(chuàng)建隊(duì)列

Myqueue::Myqueue(int queueCapacity)

{

m_iqueuecapacity=queueCapacity;

m_iHead=0;

? ? m_itail=0;

m_iqueue=0;

m_pqueue=new int[m_iqueuecapacity];

}

//銷毀隊(duì)列

Myqueue::~Myqueue()

{

delete []m_pqueue;

m_pqueue=NULL;

}

//清空隊(duì)列

void Myqueue::clearqueue()

{

m_iHead=0;

? ? m_itail=0;

m_iqueue=0;

}

//判空隊(duì)列檢測(cè)

bool Myqueue::queueempty()const

{

return m_iqueue==0?true:false;

}

//判滿隊(duì)列檢測(cè)

bool Myqueue::queuefill()const

{

return m_iqueue==m_iqueuecapacity?true:false;

}

//隊(duì)列的長(zhǎng)度

int Myqueue::queuelength()

{

return m_iqueue;

}

//新元素進(jìn)隊(duì)

bool Myqueue::enqueue(int element)

{

if(queuefill())

{return false;}

else

{m_pqueue[m_itail ]=element;

m_itail++;

m_itail=m_itail%m_iqueuecapacity;

m_iqueue++;

return true;

}

}

//首元素出隊(duì)

bool Myqueue::dequeue(int &element)

{

if(queueempty())

{

return false;

}

else

? ?{

element=m_pqueue[m_iHead];

m_iHead++;

m_iHead=m_iHead%m_iqueuecapacity;

m_iqueue--;

return true;

}

}

void Myqueue::queuetraverse()

{

for(int i=m_iHead;i<m_iqueue+m_iHead;i++)

{

cout<<m_pqueue[i%m_iqueue]<<endl;

}

}

int main(void)

{

Myqueue *p=new Myqueue(4);

p->enqueue(12);

p->enqueue(22);

p->queuetraverse();

delete p;

p=NULL;

system("pause");

return 0;

}