chpt 5

Author: elstr-512

helloWorld/RuntimeException.h

@@ -0,0 +1,17 @@
+#pragma once
+
+#include <string>
+using namespace std;
+
+class RuntimeException {
+  public:
+    RuntimeException(const string& error) {
+        errorMessage = error;
+    }
+    string getMessage() const {
+        return errorMessage;
+    }
+  
+  private:
+    string errorMessage;
+};

source/chpt_5_StacksQueuesDeques/parenthesesMatching/ArrayStack.h

@@ -0,0 +1,55 @@
+#pragma once
+
+template <typename E> class ArrayStack {
+public:
+  ArrayStack(int capacity = DEFAULT_CAPACITY);
+  int size() const;
+  bool empty() const;
+  const E &top() const;
+  void push(const E &element);
+  void pop();
+
+private:
+  enum { DEFAULT_CAPACITY = 100 };
+  E *m_stack;
+  int m_capacity;
+  int m_topIndex;
+};
+
+template <typename E>
+ArrayStack<E>::ArrayStack(int capacity)
+    : m_stack(new E[capacity]), m_capacity(capacity), m_topIndex(-1) {}
+
+template <typename E>
+int ArrayStack<E>::size() const { 
+  return (m_topIndex + 1);
+}
+
+template <typename E>
+bool ArrayStack<E>::empty() const {
+  return (m_topIndex < 0);
+}
+
+template <typename E>
+const E &ArrayStack<E>::top() const {
+  if (empty()) {
+    throw "Top of empty stack";
+  }
+  return m_stack[m_topIndex];
+}
+
+template <typename E>
+void ArrayStack<E>::push(const E &element) {
+    if (size() == m_capacity) {
+        throw "Stack full";
+    }
+    m_stack[++m_topIndex] = element;
+}
+
+template <typename E>
+void ArrayStack<E>::pop() {
+    if (empty()) {
+        throw "Pop for empty stack";
+    }
+    m_topIndex--;
+}

source/chpt_5_StacksQueuesDeques/parenthesesMatching/main.cpp

@@ -0,0 +1,50 @@
+#include "ArrayStack.h"
+#include <iostream>
+#include <string>
+
+bool parenthesesMatch(const std::string &expression) {
+
+  char openParentheses = '(';
+  char closeParentheses = ')';
+
+  ArrayStack<char> stack;
+
+  for (int i = 0; i < expression.size(); i++) {
+    char e = expression.at(i);
+
+    if (e == openParentheses) {
+      stack.push(e);
+    } else if (e == closeParentheses) {
+      if (stack.empty()) {
+        return false;
+      }
+      if (stack.top() != openParentheses) {
+        return false;
+      }
+      stack.pop();
+    }
+  }
+  if (stack.empty()) {
+    return true;
+  } else {
+    return false;
+  }
+}
+
+void printValid(const std::string &expression) {
+  std::string result;
+  if (parenthesesMatch(expression)) {
+    result = "is valid\n";
+  } else {
+    result = "is not valid\n";
+  }
+  std::cout << expression << " " << result;
+}
+
+int main(int argc, char const *argv[]) {
+
+  printValid("(1+2)*2");
+  printValid("(1+2))*2");
+
+  return 0;
+}

source/chpt_5_StacksQueuesDeques/stacks/ArrayStack.h

@@ -0,0 +1,55 @@
+#pragma once
+
+template <typename E> class ArrayStack {
+public:
+  ArrayStack(int capacity = DEFAULT_CAPACITY);
+  int size() const;
+  bool empty() const;
+  const E &top() const;
+  void push(const E &element);
+  void pop();
+
+private:
+  enum { DEFAULT_CAPACITY = 100 };
+  E *m_stack;
+  int m_capacity;
+  int m_topIndex;
+};
+
+template <typename E>
+ArrayStack<E>::ArrayStack(int capacity)
+    : m_stack(new E[capacity]), m_capacity(capacity), m_topIndex(-1) {}
+
+template <typename E>
+int ArrayStack<E>::size() const { 
+  return (m_topIndex + 1);
+}
+
+template <typename E>
+bool ArrayStack<E>::empty() const {
+  return (m_topIndex < 0);
+}
+
+template <typename E>
+const E &ArrayStack<E>::top() const {
+  if (empty()) {
+    throw "Top of empty stack";
+  }
+  return m_stack[m_topIndex];
+}
+
+template <typename E>
+void ArrayStack<E>::push(const E &element) {
+    if (size() == m_capacity) {
+        throw "Stack full";
+    }
+    m_stack[++m_topIndex] = element;
+}
+
+template <typename E>
+void ArrayStack<E>::pop() {
+    if (empty()) {
+        throw "Pop for empty stack";
+    }
+    m_topIndex--;
+}

source/chpt_5_StacksQueuesDeques/stacks/main.cpp

@@ -0,0 +1,11 @@
+#include "ArrayStack.h"
+#include <iostream>
+
+int main(int argc, char const *argv[]) {
+
+  ArrayStack<int> arrayStack;
+
+  std::cout << arrayStack.empty() << std::endl;
+
+  return 0;
+}