#include "LinkedList.hpp" #include #include #include // Ex1 template void shuffle(LinkedList& l) { auto fast = l.begin(), slow = l.begin(), end = l.end(); while (fast != end) { ++fast; if (fast != end) { ++fast; ++slow; } } int pops = 0; while (++slow != end) { l.pushFront(*slow); pops++; } while (pops-- > 0) l.popBack(); } template void print(LinkedList& l) { for (const T& elem : l) { std::cout << elem << " "; } std::cout << std::endl; } void ex1() { LinkedList l; l.pushBack(1); l.pushBack(2); l.pushBack(3); l.pushBack(4); l.pushBack(5); print(l); shuffle(l); print(l); } // Ex2 void print(LinkedList*>& l) { for (const std::stack* elem : l) { if (!elem->empty()) std::cout << elem->top() << " "; } std::cout << std::endl; } #define min(a,b) (a*>& l) { std::queue valueSize; std::queue valueHolder; for (std::stack* elem : l) { valueSize.push(elem->size()); while (!elem->empty()) { valueHolder.push(elem->top()); elem->pop(); } } std::queue leftovers; size_t amountPer = valueHolder.size() / l.size(); for (std::stack* elem : l) { size_t cpyOriginals = min(amountPer, valueSize.front()); for (size_t i = 0; i < cpyOriginals; i++) { elem->push(valueHolder.front()); valueHolder.pop(); } for (int i = valueSize.front() - amountPer; i > 0; i--) { leftovers.push(valueHolder.front()); valueHolder.pop(); } valueSize.pop(); } for (std::stack* elem : l) { for (size_t i = amountPer - elem->size(); i > 0; i--) { elem->push(leftovers.front()); leftovers.pop(); } } } void ex2() { LinkedList*> l; l.pushBack(new std::stack()); l.back()->push(1); l.back()->push(2); l.back()->push(3); l.back()->push(4); l.back()->push(5); l.pushBack(new std::stack()); l.back()->push(6); l.back()->push(7); l.pushBack(new std::stack()); l.back()->push(8); l.back()->push(9); l.back()->push(10); l.back()->push(11); l.pushBack(new std::stack()); l.back()->push(12); print(l); equalize(l); print(l); } // Ex 3 // LinkedListNode* partition(LinkedListNode* head, int x) { // // } int main() { ex2(); }