Создать стек целых чисел на основе статического массива. - C++ - Ответ 2319872

#include <iostream>
#include <stdexcept>
 
template <int N>
class Stack {
 public:
  explicit Stack()
    : begin_(), end_(begin_ + N), top_(begin_) {}
  virtual ~Stack() {
    delete [] begin_;
  }
  void clear() {
    top_ = begin_;
  }
  size_t size() const {
    return top_ - begin_;
  }
  void push(int value) {
    if (top_ < end_)
      *top_++ = value;
    else
      throw std::overflow_error("Stack overflow.");
  }
  int pop() {
    if (top_ > begin_)
      return *--top_;
    else
      throw std::underflow_error("Stack underflow.");
  }
  int top() const {
    if (top_ > begin_)
      return *(top_ - 1);
    else
      throw std::underflow_error("Stack underflow.");
  }
 private:
  Stack(const Stack &other);
  Stack &operator=(const Stack &other);
  int begin_[N];
  int *end_;
  int *top_;
};
 
int main(int argc, char *argv[]) {
  Stack<10> stack;
 
  try {
    std::cout << "Top of stack: " << stack.top() << std::endl;
  } catch (std::underflow_error &e) {
    std::cout << "Cannot show top of the stack. It is empty." << std::endl;
  }
 
  try {
    for (size_t i = 0; i < 11; ++i)
      stack.push(i);
  } catch (std::runtime_error &e) {
    std::cout << "Exception caught while pushing data: "
      << e.what() << std::endl;
  }
 
  try {
    std::cout << "Top of stack: " << stack.top() << std::endl;
  } catch (std::underflow_error &e) {
    std::cout << "Cannot show top of the stack. It is empty." << std::endl;
  }
 
  try {
    for (size_t i = 0; i < 11; ++i)
      std::cout << stack.pop() << std::endl;
  } catch (std::runtime_error &e) {
    std::cout << "Exception caught while popping data: "
      << e.what() << std::endl;
  }
}