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
|
#include<iostream>
#include"../Seminar04/linked-list-utils.h"
#include<stack>
using ListNode = LinkedListNode<std::stack<int>>;
// O(k*n) памет, където n е дължината на списъка а k размера на най - големия стек
// O(k*n) време
void equalize(ListNode* ll) {
std::stack<int> temp;
ListNode* iter = ll;
while(iter) {
while(!iter->data.empty()) {
temp.push(iter->data.top());
iter->data.pop();
}
iter = iter->next;
}
iter = ll;
while(!temp.empty()) {
if(iter == nullptr) {
iter = ll;
}
iter->data.push(temp.top());
temp.pop();
iter = iter->next;
}
}
void printStack(std::stack<int> s) {
int size = s.size();
std::cout << "[";
while (!s.empty()) {
std::cout << s.top() << " ";
s.pop();
}
std::cout << "] -> " << size << std::endl;
}
int main() {
ListNode* ll = fromList(
{
std::stack<int>({1, 4}),
std::stack<int>({6, 7, 8, 9, 5}),
std::stack<int>({10, 11, 12}),
std::stack<int>({1, 41}),
std::stack<int>({6, 7, 8, 9, 5, 7, 9, 0, 10, 20, 30})
}
);
equalize(ll);
printLinkedList(ll, printStack);
freeList(ll);
}
|
