队列小记三之链式存储

线性表的存储方式有顺序存储和链式存储，前两篇均是队列顺序存储的例子，以下是链式存储的代码：

#include <string.h>
#include <malloc/malloc.h>

struct Node {
    int data;
    struct Node *next;
};

struct Fifo {
    struct Node *front;
    struct Node *rear;
};
//初始化队列
void init(struct Fifo *fifo) {
    struct Node *node = (struct Node *)malloc(sizeof(struct Node));
    node->next = NULL;
    fifo->front = node;
    fifo->rear = node;
}
//进队
int put(struct Fifo *fifo, int value) {
    struct Node * node = (struct Node *)malloc(sizeof(struct Node));
    node->next = NULL;
    node->data = value;
    fifo->rear->next = node;
    fifo->rear = node;
    return 0;
}

//出队
int get(struct Fifo *fifo) {
    if (!fifo->front->next) {
        return -1;
    }
    struct Node* node = fifo->front->next;
    int value = node->data;
    fifo->front->next = node->next;

    free(node);
    node = NULL;
    return value;
}
//销毁队列
void destroy(struct Fifo *fifo) {
    while (fifo->front->next) {
        get(fifo);
    }
    free(fifo->front);
    fifo->front = NULL;
    fifo->rear = NULL;
}
//清空队列
void clear(struct Fifo *fifo) {
    while (fifo->front->next) {
        get(fifo);
    }
    fifo->rear = fifo->front;
}