#ifndef queue_h
#define queue_h
#include <iostream>
const int Queue_Maxsize = 10;
class queue
{
private:
int front;
int rear;
int data[Queue_Maxsize];
public:
queue()
{
front = 0;
rear = 0;
}
bool is_empty()
{
return front == rear;
}
bool is_full()
{
return (rear + 1) % Queue_Maxsize == front;
}
bool enqueue(int dt)
{
if(is_full())
return false;
else
{
data[rear] = dt;
rear = (rear + 1) % Queue_Maxsize;
return true;
}
}
bool dequeue(int &dt)
{
if(is_empty())
return false;
else
{
dt = data[front];
front = (front + 1) % Queue_Maxsize;
return true;
}
}
void display()
{
int i = front;
while(i != rear)
{
std::cout << data[i] << " ";
i = (i+1) % Queue_Maxsize;
}
}
~queue(){}
};
#endif
//main.cpp
#include "queue.h"
#include "stdio.h"
void number(int n);
int main()
{
int i, n = 9;
printf("初始序列:");
for(i = 1; i <= n; i++)
printf("%d", i);
printf("\n");
number(n);
return 0;
}
void number(int n)
{
queue q;
int i = 1;
int temp;
while(i <= n && q.enqueue(i))
{
i++;
}
std::cout << "出队序列:";
while(!q.is_empty())
{
q.dequeue(temp);
std::cout << temp << " ";
if(q.is_empty())
break;
q.dequeue(temp);
q.enqueue(temp);
}
}