顺序队列C语言

顺序队列

SqQueue.h文件

#ifndef SQQUEUE_H
#define SQQUEUE_H

typedef unsigned  int QElemType;    //QElemType类型根据实际情况而定

typedef struct
{
    QElemType* base;                //队头
    unsigned int Length;            //队尾
    unsigned int MaxSize;           //存储空间最大值
}SqQueue;
    
/*空队列*/
void SqQueue_Init(SqQueue* Q, unsigned int size);
/*入队*/
void SqQueue_Enter(SqQueue* Q, QElemType e);
/*遍历队列*/
void SqQueue_Traverse(SqQueue Q);
/*获取队头元素*/
QElemType SqQueue_GetFront(SqQueue Q);
/*出队*/
QElemType SqQueue_Delete(SqQueue* Q);
/*清空队列*/
void SqQueue_Clear(SqQueue* Q);
/*销毁队列*/
void SqQueue_Destroy(SqQueue* Q);
/*测试*/
void SqQueue_Test(void);

#endif // SQQUEUE_H

SqQueue.c文件

#include "SqQueue.h"

#include <stdio.h>
#include <stdlib.h>
#include<assert.h>

static const unsigned int INCREMENT = 5;       //存储空间增量

/*空队列*/
void SqQueue_Init(SqQueue* Q, unsigned int size)
{
	Q->Length = 0;
	Q->MaxSize = size;
	Q->base = calloc(sizeof(QElemType), Q->MaxSize);
}
/*入队，尾进*/
void SqQueue_Enter(SqQueue* Q, QElemType e)
{
    assert(Q->base != NULL);    //顺序队列存在

    Q->base[Q->Length] = e;
    Q->Length += 1;

    if (Q->Length == Q->MaxSize)
    {
        Q->MaxSize += INCREMENT;
        QElemType* temp = realloc(Q->base, sizeof(QElemType) * Q->MaxSize);
        if (temp != NULL)           //防止重新分配内存失败后，原地址丢失
        {
            Q->base = temp;
        }
    }
}
/*遍历队列*/
void SqQueue_Traverse(SqQueue Q)
{
    assert(Q.Length != 0);   //断言，顺序队列不空

    for (unsigned int i = 0; i < Q.Length; i++)
    {
        printf("%d ", Q.base[i]);
    }
    printf("\n");
}
/*获取队头元素*/
QElemType SqQueue_GetFront(SqQueue  Q)
{
    assert(Q.Length != 0);   //断言，顺序队列不空
    
    return Q.base[0];
}
/*出队，头出*/
QElemType SqQueue_Delete(SqQueue* Q)
{
    assert(Q->Length != 0);   //断言，顺序队列不空

    QElemType e = Q->base[0];
    for (unsigned int i =0; i < Q->Length; i++)
    {
        Q->base[i] = Q->base[i + 1];
    }
    Q->Length -= 1;
    return e;
}
/*清空队列*/
void SqQueue_Clear(SqQueue* Q)
{
    assert(Q->Length != 0);   //断言，顺序栈不空

    for (unsigned int i = 0; i < Q->Length; i++)
    {
        Q->base[i] = 0;
    }
    Q->Length = 0;
}
/*销毁队列*/
void SqQueue_Destroy(SqQueue* Q)
{
    assert(Q->base != NULL);    //顺序队列存在

    free(Q->base);
    Q->base = NULL;
    Q->Length = 0;
    Q->MaxSize = 0;
}
/*测试*/
void SqQueue_Test(void)
{
    SqQueue Q;
    SqQueue_Init(&Q, 3);
    SqQueue_Enter(&Q, 1);
    SqQueue_Enter(&Q, 2);
    SqQueue_Enter(&Q, 3);
    SqQueue_Enter(&Q, 4);
    SqQueue_Enter(&Q, 5);
    SqQueue_Traverse(Q);
    SqQueue_Delete(&Q);
    SqQueue_Delete(&Q);
    SqQueue_Traverse(Q);
    printf("%d\n", SqQueue_GetFront(Q));
    SqList_Destroy(&Q);
    printf("%p\n", Q.base);
}

测试：main.c文件

#include  <stdio.h>
#include "SqQueue.h"

int main()
{
	SqQueue_Test();
	return 0;
}

测试结果