배열 스택 (Array Stack)

#pragma once

const int MAX = 100;

class ArrayStack
{
private:
	int* m_stack;
	int m_top;
	int m_max;

public:
	ArrayStack(int MAX);
	~ArrayStack();

	void Push(int _item);
	int Pop();
	bool IsEmpty();
	bool IsFull();
};

ArrayStack.h

 

 

#include "ArrayStack.h"

ArrayStack::ArrayStack(int MAX) : m_top(0), m_max(MAX)
{
	m_stack = new int[MAX];

}

ArrayStack::~ArrayStack()
{
	delete[] m_stack;

}

void ArrayStack::Push(int _item)
{
	IsFull() ? -1 : m_stack[m_top++] = _item;

}

int ArrayStack::Pop()
{
	return IsEmpty() ? -1 : m_stack[--m_top];

}

bool ArrayStack::IsEmpty()
{
	return m_top == 0;
    
}

bool ArrayStack::IsFull()
{
	return m_top == m_max;
    
}

ArrayStack.cpp