c++ q

//기본적인 큐라 효율이 쓰래기

#include<iostream>

using namespace::std;

template<typename T>

class Queue

{

enum { cap = 10 };

T arr[cap];

int front;

int rear;

public:

Queue() :front(0), rear(0) {};

void Push(T num)

{

arr[rear = (rear + 1) % cap] = num;

}

void Pop()

{

cout << arr[front=(front+1)%cap] << endl;

}

bool Empty()

{

return front == rear;

}

};

int main()

{

Queue<int> q;

q.Push(10);

q.Pop();

q.Empty();

q.Push(20);

q.Push(30);

q.Pop();

q.Pop();

q.Pop();

}