By yusijia

Updated:

Contents 
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
36
37
38
39
40

#include<stdio.h>
#define MAX_SIZE 1000
int que_length = 0;
int que_rear = 0;
int que_front = 0;
struct fifo{
    int data;
}que[MAX_SIZE];

int length()
{
    return que_length;
}

void push(int val)
{
    que[que_rear].data = val;     //传过来的是int型
    que_length++;
    que_rear = (que_rear + 1) % MAX_SIZE;
}

int pop()
{
    int p;
    p = que[que_front].data;
    que_front = (que_front + 1) % MAX_SIZE;
    que_length--;
    return p;
}

int isempty()
{
    return que_length == 0;
}

int isfull()
{
    return que_length == MAX_SIZE;
}
Contents