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
|
#include"../Seminar04/linked-list-utils.h"
#include<iostream>
#include<queue>
using ListNode = LinkedListNode<std::queue<int>>;
void concatenate(std::queue<int>& to, std::queue<int>& from) {
while(!from.empty()) {
to.push(from.front());
from.pop();
}
}
bool all(std::queue<int> q, bool (*pred)(int)) {
while(!q.empty()) {
if(!pred(q.front())) {
return false;
}
q.pop();
}
return true;
}
void concatenateSimilarQueues(ListNode* ll, bool (*pred)(int)) {
if(!ll || !ll->next)
return;
ListNode* iter = ll;
while(iter && iter->next) {
if(all(iter->data, pred)) {
while(iter->next && all(iter->next->data, pred)) {
ListNode* toDelete = iter->next;
iter->next = iter->next->next;
concatenate(iter->data, toDelete->data);
delete toDelete;
}
}
iter = iter->next;
}
}
void printQueue(std::queue<int> q) {
std::cout << "[ ";
while(!q.empty()) {
std::cout << q.front() << " ";
q.pop();
}
std::cout << " ]" << std::endl;
}
int main() {
ListNode* ll = fromList({
std::queue<int>({1, 2, 3}),
std::queue<int>({4, 5, 6, 7, 8, 8, 9}),
std::queue<int>({12, 14, 16}),
std::queue<int>({101, 102}),
std::queue<int>({103, 104, 105})
});
concatenateSimilarQueues(
ll,
[](int x) -> bool { return x < 10 || x > 100; }
);
printLinkedList(ll, printQueue);
freeList(ll);
}
|
