6-6 循环队列入队出队 分数 10

#include 
#include 
void EnQueue_seq(SeqQueue squeue, DataType x)  
{
    if ((squeue->r + 1) % squeue->Max == squeue->f)
    {
        printf("It is FULL Queue!");
        return;
    }

    squeue->elem[squeue->r] = x;
    squeue->r = (squeue->r + 1) % squeue->Max;
}

void DeQueue_seq(SeqQueue squeue)  
{
    if (squeue->f == squeue->r)
    {
        printf("It is empty queue!");
        return;
    }

    squeue->f = (squeue->f + 1) % squeue->Max;
}

DataType FrontQueue_seq(SeqQueue squeue) 
{
    if (squeue->f == squeue->r)
    {
        printf("It is empty queue!");
        return 0;
    }
    else
        return squeue->elem[squeue->f];
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35