环队列

#include <stdlib.h>
#include <stdio.h>
#include <conio.h>
#include <iostream>
#include <windows.h>
#include <string.h>
using namespace std;
const MAXSIZE = 20;
typedef int elemType;   //定义栈元素类型
class Queue
{
public:
    Queue();
    ~Queue();
    bool push(elemType data);   //入队
    bool pop();                 //出队
private:
    elemType front,rear;
    elemType queue[MAXSIZE];
};
 Queue::Queue()
{
    front = rear = 0;
}
 Queue::~Queue()
{
    queue[MAXSIZE] = NULL;
}

 /***********入队**************/
bool Queue::push(elemType data)
{
    if(size == MAXSIZE - 1)
    {
        cout<<"队列满";
        return false;
    }
    size++;
    queue[rear] = data;
    rear = (rear+1)%MAXSIZE;    //变到下一个位置
    return true;
}


/***********出队**************/
bool Queue::pop()
{
    if(size == 0)
    {
        cout<<"队列已空";
        return false;
    }
    size--;
    arr[++poporder] = queue[front]; 
    front = (front+1) % MAXSIZE;
    return true;
}