#include<iostream>
#define elemType int
using namespace std ;
struct Que
{
Que* front;
Que* rear;
elemType data;
};
class lineQue
{
private:
Que* first;
int maxLength;
public:
lineQue();
~lineQue();
void addQ(elemType e);
void deleteQ(elemType &e);
};
lineQue::lineQue()
{
maxLength = 100 ;
first= new Que[maxLength] ;
first->front = first ;
first->rear = first ;
}
lineQue::~lineQue()
{
delete []first ;
}
void lineQue::addQ(elemType e)
{
first->rear->data = e ;
first->rear++ ;
}
void lineQue::deleteQ(elemType &e)
{
e=first->front->data;
first->front++ ;
}
int main()
{
lineQue lq;
int a = 0;
for(int i=0;i<10;i++)
{
lq.addQ(i) ;
}
for(int i=0;i<10;i++)
{
lq.deleteQ(a);
cout<<a<<" " ;
}
cout<<endl ;
system("pause");
}
#define elemType int
using namespace std ;
struct Que
{
Que* front;
Que* rear;
elemType data;
};
class lineQue
{
private:
Que* first;
int maxLength;
public:
lineQue();
~lineQue();
void addQ(elemType e);
void deleteQ(elemType &e);
};
lineQue::lineQue()
{
maxLength = 100 ;
first= new Que[maxLength] ;
first->front = first ;
first->rear = first ;
}
lineQue::~lineQue()
{
delete []first ;
}
void lineQue::addQ(elemType e)
{
first->rear->data = e ;
first->rear++ ;
}
void lineQue::deleteQ(elemType &e)
{
e=first->front->data;
first->front++ ;
}
int main()
{
lineQue lq;
int a = 0;
for(int i=0;i<10;i++)
{
lq.addQ(i) ;
}
for(int i=0;i<10;i++)
{
lq.deleteQ(a);
cout<<a<<" " ;
}
cout<<endl ;
system("pause");
}