스택, 큐 클래스 설계

<스택 클래스 설계>

#include<iostream>
#include<vector>
using namespace std;
 
 
class STACK
{
private:
    int top;
    vector<int> st;
    int MAX;
public:
    STACK() {};
    ~STACK() {};
    void init();
    bool isEmpty();
    bool isFull();
    void push();
    void pop();
};
 
void STACK::init()
{
    top = 0;
    MAX = 5;
    st.resize(MAX);
}
 
bool STACK::isEmpty()
{
    if (top == 0)
        return true;
 
    return false;
}
 
bool STACK::isFull()
{
    if (top == MAX)
        return true;
 
    return false;
}
 
void STACK::push()
{
    if (isFull()) {
        cout << "꽉참" << endl;
        return;
    }
 
    int tmp;
    cout << "push 할 숫자를 입력하세요:";
    cin >> tmp;
 
    st[top++] = tmp;
}
 
void STACK::pop()
{
    if (isEmpty()) {
        cout << "텅빔" << endl;
        return;
    }
 
    cout << st[--top] << endl;
 
}
 
int main()
{
    STACK st;
    st.init();
    st.push();
    st.push();
    st.push();
    st.push();
    st.push();
    st.push();
 
    st.pop();
    st.pop();
    st.pop();
    st.pop();
    st.pop();
    st.pop();
 
    return 0;
}

<큐 클래스 설계>

#include<iostream>
 
using namespace std;
 
class QUEUE
{
private:
    int arr[100];
    int MAX;
    int rear;
    int front;
 
public:
    QUEUE() {};
    ~QUEUE() {};
    void init();
    bool isFull();
    bool isEmpty();
    void push();
    void pop();
};
 
void QUEUE::init()
{
    rear = 0;
    front = 0;
    MAX = 5;
}
 
bool QUEUE::isFull()
{
    if ((rear + 1) % MAX == front)
    {
        cout << "꽉참" << endl;
        return true;
    }
 
    return false;
    
}
 
bool QUEUE::isEmpty()
{
    if (front == rear)
    {
        return true;
    }
    return false;
}
 
void QUEUE::push()
{
    if (isFull())
    {
        return;
    }
 
    int tmp;
    cout << "넣을 값 입력:";
    cin >> tmp;
    arr[rear++] = tmp;
 
    if (rear == MAX)
        rear = 0;
}
 
void QUEUE::pop()
{
    if (isEmpty())
    {
        return;
    }
 
    cout << arr[front++] << endl;
    
    if (front == MAX)
        front = 0;
 
}
 
int main()
{
    QUEUE q;
    q.init();
 
    q.push();
    q.push();
    q.push();
    q.push();
    q.push();
    q.pop();
    q.pop();
    q.pop();
    q.pop();
    q.pop();
 
 
    return 0;
}