Summary Files Commits Branches @commit @diff @stats
path: root / Year 2 / Structures and data algorithms / 06-Seminar-09.11.2022 / exercises.cpp
blob: 1981501959b645043fd1b63f486825bedf6ea1fc (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
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
#include <list>
#include <iostream>
#include <queue>
#include "DoublyLinkedList.hpp"

// Ex1

template<class T>
void insertSorted(std::list<T>& ll, const T& elem) {
	auto iter = ll.cbegin();
	while (*iter < elem)
		++iter;
	ll.insert(iter, elem);
}

void ex1() {
	std::list<int> l;
	l.push_back(1);
	l.push_back(2);
	l.push_back(4);
	l.push_back(5);

	for (int n : l) std::cout << n << " ";
	std::cout << std::endl;
	insertSorted(l, 3);
	for (int n : l) std::cout << n << " ";
	std::cout << std::endl;
}

// Ex2

void print(DoublyLinkedList<std::queue<int>*>& dll) {
	for (std::queue<int>* val : dll)
		std::cout << val->front() << " ";
	std::cout << std::endl;
}

int operate(int a, int b, char op) {
	switch(op) {
		case '+': return a + b;
		case '-': return a - b;
		case '*': return a * b;
		case '/': return a / b;
		default: return 0;
	}
}

int evaluateRPQueue(std::queue<int>& eq) {
	int accum = eq.front() - '0';
	eq.pop();
	char buf;
	while (!eq.empty()) {
		buf = eq.front();
		eq.pop();
		accum = operate(accum, buf - '0', eq.front());
		eq.pop();
	}
	return accum;
}

void evaluateQueues(DoublyLinkedList<std::queue<int>*>& dll) {
	for (std::queue<int>* eq : dll) {
		eq->push(evaluateRPQueue(*eq));
	}
}

template <class T>
bool isSymmetricBad(DoublyLinkedList<std::queue<T>*> dll) {
	while (!dll.empty()) {
		if (dll.back()->front() != dll.front()->front())
			return false;
		dll.popBack();
		if (dll.empty()) return true;
		dll.popFront();
	}
	return true;
}

template <class T>
bool isSymmetric(DoublyLinkedList<std::queue<T>*>& dll) {
	auto frontIter = dll.begin();
	auto backIter = --dll.end();

	while (frontIter != backIter) {
		if ((*frontIter)->front() != (*backIter)->front())
			return false;
		++frontIter;
		if (frontIter == backIter) return true;
		--backIter;
	}
	return true;
}

void ex2() {
	DoublyLinkedList<std::queue<int>*> dll;
	dll.pushBack(new std::queue<int>());
	dll.back()->push('4');
	dll.back()->push('5');
	dll.back()->push('+');
	dll.pushBack(new std::queue<int>());
	dll.back()->push('1');
	dll.back()->push('6');
	dll.back()->push('+');
	dll.back()->push('7');
	dll.back()->push('*');
	dll.pushBack(new std::queue<int>());
	dll.back()->push('8');
	dll.pushBack(new std::queue<int>());
	dll.back()->push('1');
	dll.back()->push('7');
	dll.back()->push('*');
	dll.back()->push('7');
	dll.back()->push('*');
	dll.pushBack(new std::queue<int>());
	dll.back()->push('2');
	dll.back()->push('3');
	dll.back()->push('*');
	dll.back()->push('3');
	dll.back()->push('+');

	print(dll);

	evaluateQueues(dll);
	print(dll);

	std::cout << isSymmetric(dll) << std::endl;
}

int main() {
	ex2();
}