Website Summary Files Commits Branches @commit @diff @stats
path: root / Additional / concatenate-queues.cpp
diff options
context:
space:
mode:
Commit9eed63a37a808c59990feaaaa3e1725dfdd31f3c (patch)
Author
 Stoycho Kyosev <stoycho.kk@gmail.com>
2023-10-30 22:33:14 +0200
Committer
 Stoycho Kyosev <stoycho.kk@gmail.com>
2023-10-30 22:33:14 +0200
Filesbc22e2b8407f9207c7a5a8ef999f41446c0cee19 /Additional/concatenate-queues.cpp
Data-structures-and-algorithms-9eed63a37a808c59990feaaaa3e1725dfdd31f3c.tar
Data-structures-and-algorithms-9eed63a37a808c59990feaaaa3e1725dfdd31f3c.tar.gz
Data-structures-and-algorithms-9eed63a37a808c59990feaaaa3e1725dfdd31f3c.zip
Parent0f17a224d2934c748b32b908f74724b3299d263a (diff)
Add SI consultation
1 files changed, 0 insertions, 70 deletions
-rw-r--r--Additional/concatenate-queues.cpp70
diff --git a/Additional/concatenate-queues.cpp b/Additional/concatenate-queues.cpp
deleted file mode 100644
index c3f772e..0000000
--- a/Additional/concatenate-queues.cpp
+++ /dev/null
@@ -1,70 +0,0 @@
-#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);
-} \ No newline at end of file