数据结构学习第七天

14:32:26 2019-08-22

学习

队列的数组实现

QueueInArray.h

#ifndef _QUEUE_IN_ARRAY
#define _QUEUE_IN_ARRAY
struct AQueue;
typedef struct AQueue* Queue;

int IsEmpty(Queue Q);
int IsFull(Queue Q);
Queue CreateAQueue(int MaxSize);
void DisposeAQueue(Queue Q);
void MakeEmpty(Queue Q);
void Enquence(int Element, Queue Q);
int Front(Queue Q);
void Dequence(Queue Q);
int FrontAndDequence(Queue Q);
#endif // !_QUEUE_IN_ARRAY

QueueInArray.h

#include"QueueInArray.h"
#include<malloc.h>
#include<stdio.h>
struct AQueue
{
    int Capacity;
    int Front;
    int rear;
    int Size;
    int* Array;
};
static int Succ(int Value, Queue Q)
{
    if (Value < Q->Capacity)
        return Value;
    else if (IsFull(Q))
    {
        printf("Queue is Full
");
        return -1;
    }
    return 0;
}

int IsEmpty(Queue Q)
{
    return Q->Size == 0;
}

int IsFull(Queue Q)
{
    return Q->Size == Q->Capacity;
}

Queue CreateAQueue(int MaxSize)
{
    Queue Q = (Queue)malloc(sizeof(struct AQueue));
    Q->Capacity = MaxSize;
    Q->Array = (int*)malloc(sizeof(int) * MaxSize);
    MakeEmpty(Q);
    return Q;
}

void DisposeAQueue(Queue Q)
{
    free(Q->Array);
    free(Q);
}

void MakeEmpty(Queue Q)
{
    Q->Size = 0;
    Q->Front = 1;
    Q->rear = 0;
}

void Enquence(int Element, Queue Q)
{
    if (IsFull(Q))
    {
        printf("Queue is Full
");
        return;
    }
    else
    {
        Q->rear = Succ(++Q->rear,Q);
        Q->Array[Q->rear] = Element;
        Q->Size++;                     //这边将 Size++写在最后 因为在Succ的检测中会使用IsFull来进行判断
    }
}

int Front(Queue Q)
{
    return Q->Array[Q->Front];
}

void Dequence(Queue Q)
{
    if (IsEmpty(Q))
    {
        printf("Queue is Empty
");
        return;
    }
    else
    {
        Q->Front=Succ(++Q->Front,Q);
        Q->Size--;
    }
}

int FrontAndDequence(Queue Q)
{
    if (IsEmpty(Q))
    {
        printf("Queue is Empty
");
        return -1;
    }
    else
    {
        int Element = Q->Array[Q->Front];
        Dequence(Q);
        return Element;
    }
}

main.c

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

int main()
{
    Queue Q = NULL;
    Q = CreateAQueue(4);
    printf("%10d %10d
", IsEmpty(Q), IsFull(Q));
    Enquence(20, Q);
    printf("%10d %10d
", Front(Q), IsEmpty(Q));
    Enquence(25, Q);
    Enquence(30, Q);
    Enquence(45, Q);
    printf("%10d %10d
",Front(Q), IsEmpty(Q));
    Dequence(Q);
    Dequence(Q);
    printf("%10d
", FrontAndDequence(Q));
    printf("%10d
", FrontAndDequence(Q));
    DisposeAQueue(Q);
    return 0;
}

测试: