第7周实践项目1.1 环形队列中用队尾和队的元素个数来实现队列的算法库

typedef struct 
{
    Elemtype date[maxsize];
    int front;
    int count;
}sqqueue;
void initqueue (sqqueue *&q)
{
    q=(sqqueue*)malloc((sizeof(sqqueue)));
    q->front=0;
    q->count=0;
}
bool enqueue(sqqueue *&q,Elemtype e)
{
    int rear;
    if(q->count==maxsize)//队列上溢
        return  false;
    rear=(q->front+q->count)%maxsize;//求队尾位置
    rear=(rear+1)%maxsize;//队尾位置加一
    q->date[rear]=e;
    q->count++;
    return true;
}
bool dequeue(sqquque *&q,Elemtype &e)
{
    if(q->count==0)
        return false;
    q->front=(q->front+1)%maxsize;
    e=q->date[q->front];
    q->count--;
    return true;
}
bool queueempty(sqqueue *q)
{
    return q->count==0;//判断空队列
}