- 链式队列:
- 即:队列的
链式存储结构
; 本质
上就是线性表的单链表
,只是它局限于尾进头出
,也就是单链表
的尾插法
和头删法
;- 入队列:
int push_link_queue(queue_t *link_queue,int data)
{
if(NULL == link_queue)
{
printf("入参合理性检查\n");
return -1;
}
node_t *pnew = (node_t *)malloc(sizeof(node_t));
if(NULL == pnew){
printf("内存空间分配失败\n");
return -1;
}
pnew->data = data;
pnew->next = NULL;
if(NULL == link_queue->front && NULL == link_queue->rear)
{
link_queue->front = pnew;
link_queue->rear = pnew;
} else {
link_queue->rear->next = pnew;
link_queue->rear = pnew;
}
return 0;
}
- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
- 10
- 11
- 12
- 13
- 14
- 15
- 16
- 17
- 18
- 19
- 20
- 21
- 22
- 23
- 24
- 25
- 26
- 27
- 28
- 29
- 30
- 31
- 32
- 33
- 34
- 35
- 36
- 37
- 38
int pop_link_queue(queue_t *link_queue,int *data)
{
if(NULL == link_queue || NULL == data)
{
printf("入参合理性检查\n");
return -1;
}
if(queue_is_empty(link_queue))
{
printf("此时队列为空,出队失败\n");
return -1;
}
*data = link_queue->front->data;
node_t *pdel = link_queue->front;
link_queue->front = pdel->next;
free(pdel);
pdel = NULL;
if(NULL == link_queue->front)
{
link_queue->rear = NULL;
}
return 0;
}
- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
- 10
- 11
- 12
- 13
- 14
- 15
- 16
- 17
- 18
- 19
- 20
- 21
- 22
- 23
- 24
- 25
- 26
- 27
- 28
- 29
#ifndef __LINK_QUEUE_H__
#define __LINK_QUEUE_H__
#include
#include
#include
typedef struct NODE
{
int data;
struct NODE *next;
}node_t;
typedef struct link_queue{
node_t *front;
node_t *rear;
}queue_t;
int create_link_queue(queue_t **p);
int push_link_queue(queue_t *link_queue,int data);
int queue_is_empty(queue_t *link_queue);
int pop_link_queue(queue_t *link_queue,int *data);
int clean_link_queue(queue_t *link_queue);
int destroy_link_queue(queue_t **link_queue);
int print_link_queue(queue_t *link_queue);
#endif
- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
- 10
- 11
- 12
- 13
- 14
- 15
- 16
- 17
- 18
- 19
- 20
- 21
- 22
- 23
- 24
- 25
- 26
- 27
- 28
- 29
- 30
- 31
- 32
- 33
- 34
- 35
#include "link_queue.h"
int create_link_queue(queue_t **p)
{
if(NULL == p)
{
printf("入参合理性检查\n");
return -1;
}
*p = (queue_t *)malloc(sizeof(queue_t));
if(NULL == *p)
{
printf("内存空间分配失败\n");
return -1;
}
(*p)->front = NULL;
(*p)->rear = NULL;
return 0;
}
int push_link_queue(queue_t *link_queue,int data)
{
if(NULL == link_queue)
{
printf("入参合理性检查\n");
return -1;
}
node_t *pnew = (node_t *)malloc(sizeof(node_t));
if(NULL == pnew){
printf("内存空间分配失败\n");
return -1;
}
pnew->data = data;
pnew->next = NULL;
if(NULL == link_queue->front && NULL == link_queue->rear)
{
link_queue->front = pnew;
link_queue->rear = pnew;
} else {
link_queue->rear->next = pnew;
link_queue->rear = pnew;
}
return 0;
}
int queue_is_empty(queue_t *link_queue)
{
if(NULL == link_queue)
{
printf("入参合理性检查\n");
return -1;
}
return link_queue->rear == NULL ? 1 : 0;
}
int pop_link_queue(queue_t *link_queue,int *data)
{
if(NULL == link_queue || NULL == data)
{
printf("入参合理性检查\n");
return -1;
}
if(queue_is_empty(link_queue))
{
printf("此时队列为空,出队失败\n");
return -1;
}
*data = link_queue->front->data;
node_t *pdel = link_queue->front;
link_queue->front = pdel->next;
free(pdel);
pdel = NULL;
if(NULL == link_queue->front)
{
link_queue->rear = NULL;
}
return 0;
}
int clean_link_queue(queue_t *link_queue)
{
if(NULL == link_queue)
{
printf("入参合理性检查\n");
return -1;
}
node_t *pdel = NULL;
while(NULL != link_queue->front)
{
pdel = link_queue->front;
link_queue->front = pdel->next;
free(pdel);
pdel = NULL;
}
link_queue->rear = NULL;
return 0;
}
int destroy_link_queue(queue_t **link_queue)
{
if(NULL == link_queue || NULL == *link_queue)
{
printf("入参合理性检查\n");
return -1;
}
clean_link_queue(*link_queue);
free(*link_queue);
*link_queue = NULL;
return 0;
}
int print_link_queue(queue_t *link_queue)
{
if(NULL == link_queue)
{
printf("入参合理性检查\n");
return -1;
}
node_t *ptemp = link_queue->front;
while(NULL != ptemp)
{
printf("%d ",ptemp->data);
ptemp = ptemp->next;
}
puts("");
return 0;
}
- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
- 10
- 11
- 12
- 13
- 14
- 15
- 16
- 17
- 18
- 19
- 20
- 21
- 22
- 23
- 24
- 25
- 26
- 27
- 28
- 29
- 30
- 31
- 32
- 33
- 34
- 35
- 36
- 37
- 38
- 39
- 40
- 41
- 42
- 43
- 44
- 45
- 46
- 47
- 48
- 49
- 50
- 51
- 52
- 53
- 54
- 55
- 56
- 57
- 58
- 59
- 60
- 61
- 62
- 63
- 64
- 65
- 66
- 67
- 68
- 69
- 70
- 71
- 72
- 73
- 74
- 75
- 76
- 77
- 78
- 79
- 80
- 81
- 82
- 83
- 84
- 85
- 86
- 87
- 88
- 89
- 90
- 91
- 92
- 93
- 94
- 95
- 96
- 97
- 98
- 99
- 100
- 101
- 102
- 103
- 104
- 105
- 106
- 107
- 108
- 109
- 110
- 111
- 112
- 113
- 114
- 115
- 116
- 117
- 118
- 119
- 120
- 121
- 122
- 123
- 124
- 125
- 126
- 127
- 128
- 129
- 130
- 131
- 132
- 133
- 134
- 135
- 136
- 137
- 138
- 139
- 140
- 141
- 142
- 143
- 144
- 145
- 146
- 147
- 148
- 149
- 150
- 151
- 152
- 153
- 154
- 155
- 156
- 157
- 158
- 159
- 160
- 161
- 162
- 163
- 164
- 165
- 166
- 167
- 168
- 169
- 170
- 171
- 172
- 173
#include "link_queue.h"
int main(int argc, char const *argv[])
{
queue_t *link_queue = NULL;
create_link_queue(&link_queue);
printf("link_queue = %p\n",link_queue);
push_link_queue(link_queue,22);
push_link_queue(link_queue,22);
push_link_queue(link_queue,22);
push_link_queue(link_queue,99);
push_link_queue(link_queue,22);
push_link_queue(link_queue,22);
push_link_queue(link_queue,22);
push_link_queue(link_queue,66);
print_link_queue(link_queue);
int data;
pop_link_queue(link_queue,&data);
printf("%d ",data);
pop_link_queue(link_queue,&data);
printf("%d ",data);
pop_link_queue(link_queue,&data);
printf("%d ",data);
pop_link_queue(link_queue,&data);
printf("%d ",data);
pop_link_queue(link_queue,&data);
printf("%d ",data);
pop_link_queue(link_queue,&data);
printf("%d ",data);
pop_link_queue(link_queue,&data);
printf("%d ",data);
pop_link_queue(link_queue,&data);
printf("%d ",data);
puts("");
pop_link_queue(link_queue,&data);
clean_link_queue(link_queue);
print_link_queue(link_queue);
destroy_link_queue(&link_queue);
printf("link_queue = %p\n",link_queue);
return 0;
}
- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
- 10
- 11
- 12
- 13
- 14
- 15
- 16
- 17
- 18
- 19
- 20
- 21
- 22
- 23
- 24
- 25
- 26
- 27
- 28
- 29
- 30
- 31
- 32
- 33
- 34
- 35
- 36
- 37
- 38
- 39
- 40
- 41
- 42
- 43
- 44
- 45
- 46
- 47
- 48
- 49
- 50
- 51
link_queue = 0x55f7c1cbd260
22 22 22 99 22 22 22 66
22 22 22 99 22 22 22 66
此时队列为空,出队失败
link_queue = (nil)