数据结构简单队列学习(最简单)

数据结构简单队列学习(c语言)

---

• 实现效果

---

• 效果说明
  创建并加入元素后
  
  删除元素后
  

---

• 代码

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>

//Queue struct
typedef struct
{
    long unsigned head;
    long unsigned tail;
    int *queue;
    size_t arr_len;
    size_t que_len;
} Queue;

//Create an int array as Queue.Initial.
void NewCommonQueue(Queue *q, size_t QueueLen);
//Add a element for Queue.
void addElement(Queue *q, int elem);
//Delete a element of Queue.
int popElement(Queue *q);
//Show Queue.
void showQueue(Queue *q);




int main(void)
{
    Queue q;
    NewCommonQueue(&q, 5);

    addElement(&q, 2);
    addElement(&q, 3);
    addElement(&q, 4);
    addElement(&q, 5);
    addElement(&q, 6);

    showQueue(&q);
    puts("");

    int A = popElement(&q);
    int B = popElement(&q);

    showQueue(&q);
    puts("");

    printf("A = %d\n", A);
    printf("B = %d\n", B);
        

    free(q.queue);
    return 0;
}

int popElement(Queue *q)
{
    if(q == NULL)
    {
        fputs("NULL point exception\n", stderr);
        exit(0);
    }

    //Exit program if Queue is empty.
    if(q->head == q->tail)
    {
        fputs("Queue empty\n", stderr);
        exit(0);
    }
   
    int ret = q->queue[q->head + 1];
    q->head += 1;

    //Set Queue element's quality.
    q->que_len = q->tail - q->head; 

    return ret;
}

void showQueue(Queue *q)
{
    printf("head = %lu\n", q->head);
    printf("tail = %lu\n", q->tail);

    int *arr = &q->queue[q->head] + 1;
    size_t i;
    printf("{ ");
    for(i = 0; i < q->que_len; i++)
    {
        printf("%d ", arr[i]);
    }
    printf("}");
    puts("");
    return;
}

void addElement(Queue *q, int elem)
{
    if(q == NULL)
    {
        fputs("Null point exception\n", stderr);
        exit(0);
    }
    
    q->tail += 1;

    //Program exit if tail of Queue greater than array length.
    if(q->tail > q->arr_len - 1)
    {
        fputs("Queue tail err!\n", stderr);
        exit(0);
    }

    q->queue[q->tail] = elem;

    //Set Queue element's quality.
    q->que_len = q->tail - q->head;

    return;

}

void NewCommonQueue(Queue *q, size_t QueueLen)
{
    if(q == NULL)
    {
        fputs("Null point exception\n", stderr);
        exit(0);
    }

    int *newArray = (int *)malloc(sizeof(int) * (QueueLen + 1));

    //Program exit if malloc failure.
    if(newArray == NULL)
    {
        fputs("malloc error!!!\n", stderr);
        exit(0);
    }

    q->arr_len = QueueLen + 1;
    q->head = 0;
    q->tail = 0;
    q->queue = newArray;

    //Set Queue element's quality.
    q->que_len = q->tail - q->head;
    
    return;
}