#include<stdio.h>
#include<stdlib.h>
#include<assert.h>
#include<stdbool.h>
 
typedef int Quetype;          //定義隊列的數(shù)據(jù)類型
 
typedef struct QueNode        //定義數(shù)據(jù)節(jié)點
{
    struct QueNode* Next;
    Quetype data;
}QueNode;
 
typedef struct Quetail        
{                         
    struct QueNode* head;     //定義頭尾指針
    struct QueNode* tail;
}Quetail;
 
void Que_Init(Quetail* pq);                //隊列的初始化
void Que_Destory(Quetail* pq);             //隊列的銷毀
void Que_push(Quetail* pq ,Quetype data);  //插入數(shù)據(jù)
void Que_pop(Quetail* pq);                 //刪除數(shù)據(jù)
bool Que_Empty(Quetail* pq);               //判斷隊列是否為空
int Que_size(Quetail* pq);                 //統(tǒng)計隊列長度
int Que_front(Quetail* pq);                //查找隊列的頭部數(shù)據(jù)

void Que_Init(Quetail* pq)           //隊列的初始化
{
    assert(pq);
    pq->head = pq->tail = NULL;
}

//插入數(shù)據(jù)
void Que_push(Quetail* pq,Quetype data)
{ 
    assert(pq);
    QueNode* NewNode = (QueNode*)malloc(sizeof(QueNode));//創(chuàng)建節(jié)點
    if (NewNode == NULL)
    {
        printf("Que_push->malloc");
        exit(-1);
    }
    NewNode->Next = NULL;          
    NewNode->data = data;
    if (pq->head == NULL)         //判斷是否創(chuàng)建為頭節(jié)點
    {
        pq->head = NewNode;       //更新頭指針
    }
    else
    {
        pq->tail->Next = NewNode; //不為頭節(jié)點，就正常鏈接在尾節(jié)點后
    }
    pq->tail = NewNode;           //更新尾指針
}

//刪除數(shù)據(jù)
void Que_pop(Quetail* pq)
{
    assert(pq);                       
    assert(!Que_Empty(pq));         //判斷隊列是否為空
    QueNode* Next = pq->head->Next; //記錄刪除數(shù)據(jù)的
 
    if (pq->head == pq->tail)       //判斷是否是最后的數(shù)據(jù)
    {
        free(pq->head);
        pq->tail = NULL;            //更新尾指針
    }
    else
    {
        free(pq->head);             
    }
    pq->head = Next;                //更新頭指針
}

//判斷隊列是否為空
bool Que_Empty(Quetail* pq)
{
    assert(pq);
    return pq->head == NULL;
}

//查找隊列的頭部數(shù)據(jù)
Quetype Que_front(Quetail* pq)
{
    assert(pq);
    assert(!Que_Empty(pq));    //判斷隊列是否為空
    return pq->head->data;     //返回頭部數(shù)據(jù)
}

int Que_size(Quetail* pq)
{
    assert(pq);
    int size;
    QueNode* pphead = pq->head;
    for (size = 0; pphead; pphead = pphead->Next, size++);
    return size;
}

void Que_Destory(Quetail* pq)
{
    for (; !Que_Empty(pq); )  //判斷隊列是否為空
    {
        Que_pop(pq);          //刪除數(shù)據(jù)
    }
}