- #include<iostream>
- using namespace std;
- class Queue{
- public :
- int *rear;
- int *front;
- void InitQueue(Queue &q);
- int EnQueue(Queue &q,int &e);
- int OuQueue(Queue &q);
- };
- void Queue::InitQueue(Queue &q){
- q.rear=new int ;
- if(q.rear)
- q.front=q.rear;
- else
- cout<<"分配基址失败"<<endl;
- }
- int Queue:: EnQueue(Queue &q,int &e){
- *q.rear=e;
- q.rear++;
- return 0;
- }
- int Queue:: OuQueue(Queue &q){
- if(q.rear-q.front>=1)
- {cout<<*q.front<<" ";
- q.front++;
- }
- else
- cout<<"队列为空"<<endl;
- return 0;
- }
- int main(){
- Queue q;
- q.InitQueue(q);
- int i=1;
- cout<<"入队元素为1到9"<<endl;
- while(i<=9)
- {q.EnQueue(q,i);
- i++;}
- cout<<"出队元素为:"<<endl;
- int j=1;
- while(j<i)
- {q.OuQueue(q);
- ++j;}
- getchar();
- return 0;
- }
- //该片段来自于http://www.codesnippet.cn/detail/2011201411010.html
来源: http://www.codesnippet.cn/detail/2011201411010.html