数据结构 队列 C语言 简单实现

#define MAXSIZE 100

typedef struct {
    int tail;
    int head;
    int data[MAXSIZE]
} Queue;

void enqueue(Queue* q, int data) {
    if ((q->tail + 1) % MAXSIZE == q->head)
        return;

    q->data[q->tail] = data;
    q->tail = (q->tail + 1) % MAXSIZE;
}

int dequeue(Queue* q) {
    if (q->tail == q->head)
        return -1;

    int data = q->data[q->head];
    q->head = (q->head + 1) % MAXSIZE;
    return data;
}