数据结构系列8-循环队列

数据结构系列8 - 循环队列 - C语言实现

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
#include <stdio.h>
#include <stdlib.h>

#define MAXSIZE 5

typedef struct Queue {
int front;
int rear;
int data[MAXSIZE];
}Queue;

Queue* initQueue() {
Queue* Q = (Queue*)malloc(sizeof(Queue));
Q->front = Q->rear = 0;
return Q;
}

void printQueue(Queue* Q) {
// 要知道队列当前有多少个元素
int length = (Q->rear - Q->front + MAXSIZE) % MAXSIZE;
int index = Q->front;
for(int i = 0; i < length; i++) {
printf("%d -> ", Q->data[index]);
index = (index + 1) % MAXSIZE;
}
printf("NULL\n");
}

int isFull(Queue* Q) {
if ((Q->rear + 1) % MAXSIZE == Q->front) {
return 1;
}
else {
return 0;
}
}

int isEmpty(Queue* Q) {
if (Q->front == Q->rear) {
return 1;
}
else {
return 0;
}
}

int enQueue(Queue* Q, int data) {
if (isFull(Q)) {
return 0;
}
else {
Q->data[Q->rear] = data;
Q->rear = (Q->rear + 1) % MAXSIZE;
return 1;
}
}

int deQueue(Queue* Q) {
if(isEmpty(Q)) {
return -1;
}
else {
int data = Q->data[Q->front];
Q->front = (Q->front + 1) % MAXSIZE;
return data;
}
}

int main() {
Queue* Q = initQueue();
enQueue(Q, 1);
enQueue(Q, 2);
enQueue(Q, 3);
enQueue(Q, 4);
printQueue(Q);
deQueue(Q);
printQueue(Q);
return 0;
}

数据结构系列4-双链表

数据结构系列4 - 双链表 - C语言实现

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
/*************************************************************************
* File Name: DoubleLinkList.c
* Author: TyrantLucifer
* E-mail: TyrantLucifer@gmail.com
* Blog: https://tyrantlucifer.com
* Created Time: Sun 03 Jan 2021 12:26:31 AM CST
************************************************************************/
#include <stdio.h>
#include <stdlib.h>

#define TRUE 1
#define FALSE 0

typedef struct Node{
int data;
struct Node* pre;
struct Node* next;
}Node;

Node* initList(){
Node* L = (Node*)malloc(sizeof(Node));
L->data = 0;
L->pre = NULL;
L->next = NULL;
return L;
}

void headInsert(Node* L, int data){
Node* node = (Node*)malloc(sizeof(Node));
node->data = data;
if(L->data == 0){
// 链表为空
node->next = L->next;
node->pre = L;
L->next = node;
L->data ++;
}
else{
node->pre = L;
node->next = L->next;
L->next->pre = node;
L->next = node;
L->data ++;
}
}

void tailInsert(Node* L, int data){
Node* node = L;
Node* n = (Node*)malloc(sizeof(Node));
n->data = data;
while(node->next){
node = node->next;
}
n->next = node->next;
node->next = n;
n->pre = node;
L->data ++;
}

int delete(Node* L, int data){
Node* node = L->next;
while(node){
if(node->data == data){
//删除操作
node->pre->next = node->next;
node->next->pre = node->pre;
free(node);
return TRUE;
}
node = node->next;
}
return FALSE;
}

void printList(Node* L){
Node* node = L->next;
while(node){
printf("%d -> ", node->data);
node = node->next;
}
printf("NULL\n");
}

int main()
{
Node* L = initList();
headInsert(L, 1);
headInsert(L, 2);
headInsert(L, 3);
headInsert(L, 4);
tailInsert(L, 5);
tailInsert(L, 6);
printList(L);
delete(L, 1);
delete(L, 3);
printList(L);
return 0;
}

:D 一言句子获取中...