プログラマ専用SNS ミクプラ

コード:

// Stack.h
#ifndef STACK_H
#define STACK_H

class Stack {
public:
  Stack(int N) : size(0), max_size(N), top(-1), data(new int[N]) {}
  ~Stack() { delete[] data; }

  // push the element el in the stack
  // print an error message if trying to push an element in a full stack
  void push(int el); 

  // pop the element on top of the stack and return it
  // print an error message if trying to pop from 
  //   an empty stack and returns a dummy int
  int pop();
   
  // return true if stack is full 
  bool is_full(); 
  
  // return true if stack is empty
  bool is_empty(); 
  
  // return the num of elements in the stack
  int num_elements(); 

private:
  int size;
  int max_size;
  // top is the index to the topmost element of the stack
  int top; 
  int* data;
};

#endif // STACK_H

コード:

// test_stack.cpp
#include <iostream>
#include "Stack.h"

int main(void) {
  Stack s(5);

  if (s.is_empty()) std::cout << "Empty stack" << std::endl;

  s.push(2);
  s.push(5);
  s.push(7);
  s.push(9);
  s.push(9);
  
  if (s.is_full()) std::cout << "full stack" << std::endl;

  std::cout << "Num of elements: " << s.num_elements() << std::endl;

  int t;
  while (!s.is_empty()) {
   t = s.pop();         
   std::cout << t << std::endl;
   std::cout << "Num of elements: " << s.num_elements() << std::endl;
  }
}