Summary Files Commits Branches @commit @diff @stats
path: root / Year 2 / Structures and data algorithms / 02-Seminar-12.10.2022.cpp
blob: 5962c937f633ea31a2aeea21fc847ce1515dc7ad (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
132
133
134
135
136
137
138
139
140
141
#include <iostream>
#include <cstring>

template <class T>
class StackElem {
	T data;
	StackElem* next;

public:
	StackElem(T data) : StackElem(data, nullptr) {}
	StackElem(T data, StackElem* se) : data(data), next(se) {}
	~StackElem() = default;
	StackElem(StackElem& other) = delete;
	StackElem& operator=(StackElem& other) = delete;

	const T& get_data() { return this->data; }
	StackElem* get_next() { return this->next; }
	void set_next(StackElem* next) { this->next = next; }
};

template <class T>
class Stack {
	StackElem<T>* topPtr;
	StackElem<T>* startPtr;

public:
	Stack() : topPtr(), startPtr() {}
	Stack(Stack& other) = delete;
	~Stack() {
		StackElem<T>* temp;
		while (startPtr != nullptr) {
			temp = startPtr->get_next();
			delete startPtr;
			startPtr = temp;
		}
	}
	Stack& operator=(Stack& other) = delete;

	void push(T value) {
		if (topPtr == nullptr)
			startPtr = topPtr = new StackElem<T>(value);
		else {
			topPtr->set_next(new StackElem<T>(value));
			topPtr = topPtr->get_next();
		}
	}

	T pop() {
		if (topPtr == nullptr) return T();

		T temp = topPtr->get_data();
		if (startPtr == topPtr) {
			delete topPtr;
			startPtr = topPtr = nullptr;
			return temp;
		}

		StackElem<T>* prevDel = startPtr;
		while (prevDel->get_next() != topPtr)
			prevDel = prevDel->get_next();

		delete topPtr;
		topPtr = prevDel;
		prevDel->set_next(nullptr);
		return temp;
	}

	T top() {
		if (topPtr == nullptr) return T();

		return topPtr->get_data();
	}
};

// Exercise 1

void ex1() {
	const char* str = "thi*s i*s exampl*e";
	unsigned strLen = strlen(str);

	Stack<char> parsedStr;
	for (unsigned i = 0; i < strLen; i++) {
		if (str[i] == '*') parsedStr.pop();
		else parsedStr.push(str[i]);
	}

	while (parsedStr.top() != char())
		std::cout << parsedStr.pop();
	std::cout << std::endl;
}

// Exercise 2

void ex2() {
	const char* str = "()()(())";
	unsigned strLen = strlen(str);

	Stack<char> brackets;
	for (unsigned i = 0; i < strLen; i++) {
		if (str[i] == '(') brackets.push('(');
		else if (str[i] == ')') brackets.pop();
	}

	if (brackets.top() != '(')
		std::cout << "Balanced" << std::endl;
	else
		std::cout << "Unbalanced" << std::endl;
}

// Exercise 3

void ex3() {
	const char* str = "1 2 - 3 + 10 *";

	Stack<int> calc;
	while (*str != '\0') {
		if (*str >= '0' && *str <= '9') {
			calc.push(atoi(str));
			while (*str >= '0' && *str <= '9')
				str++;
		}
		else if (*str == '+')
			calc.push(calc.pop() + calc.pop());
		else if (*str == '-')
			calc.push(calc.pop() - calc.pop());
		else if (*str == '*')
			calc.push(calc.pop() * calc.pop());
		else if (*str == '/')
			calc.push(calc.pop() / calc.pop());
		else if (*str == '%')
			calc.push(calc.pop() % calc.pop());

		str++;
	}

	std::cout << calc.top() << std::endl;
}

int main() {
	ex3();
}