队列—代码

#include <stdio.h>
#include <malloc.h>

typedef struct Que
{
    int * pBase;
    int front;
    int rear;
}QUE; 

void init(QUE *);
bool en_queue(QUE *, int);
void tra_queue(QUE *);
bool full_queue(QUE *);
bool out_queue(QUE *, int * );
bool emput_queue(QUE * );

int main(void)
{
    QUE 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);
    tra_queue(&Q);
    if(out_queue(&Q, &val ))
    {
        printf("出队成功！出队的元素是%d\n", val);
    }
    else
    {
        printf("出队失败\n");
    }
    tra_queue(&Q);

    return 0;
}

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

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

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

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

bool out_queue(QUE * 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(QUE * pQ)
{
    if(pQ->front == pQ->rear)
        return true;
    else
        return false;
}

#include <stdio.h>
#include <malloc.h>

typedef struct Que
{
    int * pBase;
    int front;
    int rear;
}QUE; 

void init(QUE *);
bool en_queue(QUE *, int);
void tra_queue(QUE *);
bool full_queue(QUE *);
bool out_queue(QUE *, int * );
bool emput_queue(QUE * );

int main(void)
{
    QUE 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);
    tra_queue(&Q);
    if(out_queue(&Q, &val ))
    {
        printf("出队成功！出队的元素是%d\n", val);
    }
    else
    {
        printf("出队失败\n");
    }
    tra_queue(&Q);

    return 0;
}

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

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

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

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

bool out_queue(QUE * 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(QUE * pQ)
{
    if(pQ->front == pQ->rear)
        return true;
    else
        return false;
}