From 14281c12f710ee1cb99564201ca0464e79013827 Mon Sep 17 00:00:00 2001 From: Syndamia Date: Tue, 22 Nov 2022 15:43:07 +0200 Subject: [SDP] Fixed names of seminar 2 and seminar 3 code files --- .../02-Practicum-12.10.2022.cpp | 141 --------------------- .../02-Seminar-12.10.2022.cpp | 141 +++++++++++++++++++++ .../03-Practicum-19.10.2022.cpp | 68 ---------- .../03-Seminar-19.10.2022.cpp | 68 ++++++++++ 4 files changed, 209 insertions(+), 209 deletions(-) delete mode 100644 Year 2/Structures and data algorithms/02-Practicum-12.10.2022.cpp create mode 100644 Year 2/Structures and data algorithms/02-Seminar-12.10.2022.cpp delete mode 100644 Year 2/Structures and data algorithms/03-Practicum-19.10.2022.cpp create mode 100644 Year 2/Structures and data algorithms/03-Seminar-19.10.2022.cpp diff --git a/Year 2/Structures and data algorithms/02-Practicum-12.10.2022.cpp b/Year 2/Structures and data algorithms/02-Practicum-12.10.2022.cpp deleted file mode 100644 index 5962c93..0000000 --- a/Year 2/Structures and data algorithms/02-Practicum-12.10.2022.cpp +++ /dev/null @@ -1,141 +0,0 @@ -#include -#include - -template -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 Stack { - StackElem* topPtr; - StackElem* startPtr; - -public: - Stack() : topPtr(), startPtr() {} - Stack(Stack& other) = delete; - ~Stack() { - StackElem* 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(value); - else { - topPtr->set_next(new StackElem(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* 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 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 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 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(); -} diff --git a/Year 2/Structures and data algorithms/02-Seminar-12.10.2022.cpp b/Year 2/Structures and data algorithms/02-Seminar-12.10.2022.cpp new file mode 100644 index 0000000..5962c93 --- /dev/null +++ b/Year 2/Structures and data algorithms/02-Seminar-12.10.2022.cpp @@ -0,0 +1,141 @@ +#include +#include + +template +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 Stack { + StackElem* topPtr; + StackElem* startPtr; + +public: + Stack() : topPtr(), startPtr() {} + Stack(Stack& other) = delete; + ~Stack() { + StackElem* 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(value); + else { + topPtr->set_next(new StackElem(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* 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 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 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 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(); +} diff --git a/Year 2/Structures and data algorithms/03-Practicum-19.10.2022.cpp b/Year 2/Structures and data algorithms/03-Practicum-19.10.2022.cpp deleted file mode 100644 index 684bc63..0000000 --- a/Year 2/Structures and data algorithms/03-Practicum-19.10.2022.cpp +++ /dev/null @@ -1,68 +0,0 @@ -#include -#include - -// Ex1 : Да се напише функция, която генерира всички двоични числа от 1 до n, използвайки опашка. - -void ex1() { - unsigned max = 0; - std::cin >> max; - - std::queue numbers, output; - numbers.push(1); - uint first; - for (unsigned i = 0; i < max; i++) { - first = numbers.front(); - numbers.pop(); - - output.push(first); - - numbers.push(first * 10); - numbers.push(first * 10 + 1); - } - - while (output.size() > 0) { - std::cout << output.front() << " "; - output.pop(); - } -} - -// Ex2: Конче стои върху шахматна дъска NxN. За начална и крайна позиция да се изведе с колко най - малко хода можем да стигнем от началната до крайната. - -void ex2() { - -} - -// Ex3: Даден е масив от цели числа. Представяме си, че имаме прозорец с дължина k който се движи отляво надясно. Единственото което можем да видим са числата в прозореца. Да се изведе максимумът на всеки такъв прозорец. - -void ex3() { - int numbers[] = {1, 3, -1, -3, 5, 3, 6, 7}; - int numLen = 8; - int k = 3; - - std::queue window; - std::deque maxes; - maxes.push_front(numbers[0]); - for (unsigned i = 0; i < k; i++) { - window.push(numbers[i]); - if (numbers[i] > maxes.front()) { - maxes.pop_front(); - maxes.push_front(numbers[i]); - } - } - - for (unsigned i = k; i < numLen; i++) { - window.pop(); - window.push(numbers[i]); - maxes.push_back((numbers[i] > maxes.back()) ? numbers[i] : maxes.back()); - } - - while(!maxes.empty()) { - std::cout << maxes.front() << " "; - maxes.pop_front(); - } -} - - -int main() { - ex3(); -} diff --git a/Year 2/Structures and data algorithms/03-Seminar-19.10.2022.cpp b/Year 2/Structures and data algorithms/03-Seminar-19.10.2022.cpp new file mode 100644 index 0000000..684bc63 --- /dev/null +++ b/Year 2/Structures and data algorithms/03-Seminar-19.10.2022.cpp @@ -0,0 +1,68 @@ +#include +#include + +// Ex1 : Да се напише функция, която генерира всички двоични числа от 1 до n, използвайки опашка. + +void ex1() { + unsigned max = 0; + std::cin >> max; + + std::queue numbers, output; + numbers.push(1); + uint first; + for (unsigned i = 0; i < max; i++) { + first = numbers.front(); + numbers.pop(); + + output.push(first); + + numbers.push(first * 10); + numbers.push(first * 10 + 1); + } + + while (output.size() > 0) { + std::cout << output.front() << " "; + output.pop(); + } +} + +// Ex2: Конче стои върху шахматна дъска NxN. За начална и крайна позиция да се изведе с колко най - малко хода можем да стигнем от началната до крайната. + +void ex2() { + +} + +// Ex3: Даден е масив от цели числа. Представяме си, че имаме прозорец с дължина k който се движи отляво надясно. Единственото което можем да видим са числата в прозореца. Да се изведе максимумът на всеки такъв прозорец. + +void ex3() { + int numbers[] = {1, 3, -1, -3, 5, 3, 6, 7}; + int numLen = 8; + int k = 3; + + std::queue window; + std::deque maxes; + maxes.push_front(numbers[0]); + for (unsigned i = 0; i < k; i++) { + window.push(numbers[i]); + if (numbers[i] > maxes.front()) { + maxes.pop_front(); + maxes.push_front(numbers[i]); + } + } + + for (unsigned i = k; i < numLen; i++) { + window.pop(); + window.push(numbers[i]); + maxes.push_back((numbers[i] > maxes.back()) ? numbers[i] : maxes.back()); + } + + while(!maxes.empty()) { + std::cout << maxes.front() << " "; + maxes.pop_front(); + } +} + + +int main() { + ex3(); +} -- cgit v1.3.1-26-gb76a