-
Notifications
You must be signed in to change notification settings - Fork 0
/
deque.c
121 lines (108 loc) · 2.35 KB
/
deque.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
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
#include <stdio.h>
#include <stdlib.h>
typedef int Item;
typedef struct node {
Item item;
struct node *proximo;
struct node *anterior;
} Node;
typedef struct {
Node *head;
Node *tail;
} Deque;
void inicializaDeque(Deque *d) {
d->head = NULL;
d->tail = NULL;
}
void insereInicioDeque(Deque *d, Item item) {
Node *aux = malloc(sizeof(Node));
aux->item = item;
aux->anterior = NULL;
aux->proximo = NULL;
if (d->head == NULL) {
d->head = aux;
d->tail = aux;
} else {
aux->proximo = d->head;
d->head->anterior = aux;
d->head = aux;
}
}
void insereFimDeque(Deque *d, Item item) {
Node *aux = malloc(sizeof(Node));
aux->item = item;
aux->anterior = NULL;
aux->proximo = NULL;
if (d->head == NULL) {
d->head = aux;
d->tail = aux;
} else {
aux->anterior = d->tail;
d->tail->proximo = aux;
d->tail = aux;
}
}
void removeInicioDeque(Deque *d) {
Item i;
Node *aux = d->head;
i = d->head->item;
if (d->head == d->tail) {
d->head = NULL;
d->tail = NULL;
} else {
d->head = d->head->proximo;
d->head->anterior = NULL;
}
printf("%d\n", i);
free(aux);
}
void removeFimDeque(Deque *d) {
Item i;
Node *aux = d->tail;
i = d->tail->item;
if (d->head == d->tail) {
d->head = NULL;
d->tail = NULL;
} else {
d->tail = d->tail->anterior;
d->tail->proximo = NULL;
}
printf("%d\n", i);
free(aux);
}
void liberaDeque(Deque *d) {
int qtd = 0;
Node *aux;
while (d->head != NULL) {
qtd++;
aux = d->head;
d->head = d->head->proximo;
free(aux);
}
d->tail = NULL;
printf("%d\n", qtd);
}
int main() {
Deque d;
int N, i, O, I;
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", &O);
if (O == 1) {
inicializaDeque(&d);
} else if (O == 2) {
scanf("%d", &I);
insereInicioDeque(&d, I);
} else if (O == 3) {
scanf("%d", &I);
insereFimDeque(&d, I);
} else if (O == 4) {
removeInicioDeque(&d);
} else if (O == 5) {
removeFimDeque(&d);
} else if (O == 6) {
liberaDeque(&d);
}
}
return 0;
}