#include<stdio.h>
#include<malloc.h>
typedef struct Queue
{
    int *pBase;
    int front;
    int rear;

} QUEUEQ ;

void init(QUEUEQ *);

bool en_queue(QUEUEQ *,int val);

void traverse_queue(QUEUEQ * pQ);

bool full_queue(QUEUEQ *);

bool emput_queue(QUEUEQ * pQ);

bool out_queue(QUEUEQ *, int *pval);


int main()
{
    QUEUEQ Q;
    int val;

    init(&Q);

    en_queue(&Q, 1);
    en_queue(&Q, 2);
    en_queue(&Q, 3);
    en_queue(&Q, 4);
    en_queue(&Q, 5);
    en_queue(&Q, 6);
    en_queue(&Q, 7);
    en_queue(&Q, 8);

       traverse_queue( &Q);
   
    if(out_queue(&Q,&val))
    {
        
        printf("出队成功%d\n",val);
    }
    else
    {
        printf("出队失败");
    }
    printf("\n");
    traverse_queue( &Q);

    return 0;
}

void init(QUEUEQ * pQ)
{
    pQ->pBase = (int *)malloc(sizeof(int) * 6);
    pQ->front = 0;
    pQ->rear = 0;

}
bool full_queue(QUEUEQ *pQ)
{
    if((pQ->rear + 1) % 6 == pQ->front)
        return true;
    else
        return false;

}

bool en_queue(QUEUEQ * pQ, int val)
{
    if( full_queue(pQ))
    {
        return false;
    }
    else
    {
        pQ->pBase[pQ->rear] = val;
        pQ->rear = (pQ->rear + 1) % 6;
        return true;
    }
}

void  traverse_queue(QUEUEQ * pQ)
{
    int i = pQ->front;
    while(i != pQ->rear)
    {
        printf("%d ",pQ->pBase[i]);
        i = (i+1) % 6;
    }
    printf("\n");
    return ;
}

bool emput_queue(QUEUEQ * pQ)
{
    if(pQ->front == (pQ->rear + 1) % 6)
        return true;
    else
        return false;
}
 bool out_queue(QUEUEQ *pQ, int *pval)
{
    if( emput_queue(pQ) )
        return false;
    else
    {
        *pval = pQ->pBase[pQ->front];
        pQ->front = (pQ->front + 1) % 6;
        return true;
        
    }
   
}

bool emput_queue(QUEUEQ * pQ)
{
    return pQ->front == pQ->rear;
}

bool emput_queue(QUEUEQ * pQ)
{
    if(pQ->rear == (pQ->front + 1) % 6)
        return true;
    else
        return false;
}

还是自己找到了  这里这样写就对了