[C++ & 자료구조]배열기반 스택

ArrayBaseStack.h

배열 스택

#ifndef __AB_STACK_H__
#define __AB_STACK_H__
 
#define STACK_LEN    100
typedef int Data;
 
class ArrayStack
{
private:
    Data stackArr[STACK_LEN];
    int topIndex;
 
public:
    ArrayStack()
    {
        topIndex = -1;
    }
    bool SIsEmpty();
 
    void SPush(Data data);
    Data SPop();
    Data SPeek();
};
 
#endif

.ArrayBaseStack.cpp

#include<iostream>
#include"ArrayBaseStack.h"
using namespace std;
 
bool ArrayStack::SIsEmpty()
{
    if (topIndex == -1)
        return true;
    else
        return false;
}
 
void ArrayStack::SPush(Data data)
{
    topIndex += 1;
    stackArr[topIndex] = data;
}
 
Data ArrayStack::SPop()
{
    int rIdx;
    
    if (SIsEmpty())
    {
        cout << "Stack is empty!" << endl;
        exit(-1);
    }
        
    rIdx = topIndex;
    topIndex -= 1;
 
    return stackArr[rIdx];
}
 
Data ArrayStack::SPeek()
{
    if (SIsEmpty())
    {
        cout << "Stack is empty!" << endl;
        exit(-1);
    }
 
    return stackArr[topIndex];
}
 
int main()
{
    ArrayStack stack;
 
    stack.SPush(1);
    stack.SPush(2);
    stack.SPush(3);
    stack.SPush(4);
    stack.SPush(5);
 
    while (!stack.SIsEmpty())
        cout << stack.SPop() << " ";
 
    return 0;
}