blob: f27416ac902f638950e2ab68c7bf163d7845d765 (
plain) (
blame)
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
|
#include <iostream>
struct Node
{
Node* next = nullptr;
int data = 0;
Node(int data, Node* next = nullptr) : data(data), next(next){}
};
struct Queue
{
Node* head = nullptr;
Node* tail = nullptr;
};
void push(Queue& q, int el)
{
if (q.head == nullptr)
q.head = q.tail = new Node(el);
else
{
Node* newNode = new Node(el);
q.tail->next = newNode;
q.tail = newNode;
}
}
void pop(Queue& q)
{
if (!q.head)
return;
Node* toDelete = q.head;
q.head = q.head->next;
delete toDelete;
}
void insert(Queue& q, int el)
{
Node* iter = q.head;
while (iter)
{
if (iter->data % 10 == el % 10)
{
break;
}
iter = iter->next;
}
if (iter)
{
Node* newNode = new Node(el);
newNode->next = iter->next;
iter->next = newNode;
}
else
{
if (!q.head)
{
Node* newNode = new Node(el);
q.head = q.tail = newNode;
}
else
{
Node* newNode = new Node(el);
q.tail->next = newNode;
q.tail = newNode;
}
}
}
void print(const Queue& q)
{
const Node* it = q.head;
while(it)
{
std::cout << it->data << " ";
it = it->next;
}
}
void free(Queue& q)
{
while (q.head)
{
Node* toDelete = q.head;
q.head = q.head->next;
delete toDelete;
}
}
int main()
{
Queue q;
push(q, 1);
push(q, 2);
push(q, 4);
push(q, 8);
push(q, 16);
insert(q, 12);
print(q);
free(q);
}
|