큐

#include <iostream>

using namespace std;
class Queue {
	int front, rear, maxsize;
	int *queue;

public:

	Queue(int size) {
		maxsize = size;
		queue = new int[maxsize];
		front = rear = -1;
	}
	bool isFull() {
		if (rear == maxsize - 1)
			return true;
		else
			return false;
	}
	bool isEmpty() {
		if (rear == front)
			return true;
		else
			return false;
	}
	int deletedt() {//front는 시작 이전의 것 가지고있음
		if (!isEmpty())
		{
			front++;
			int tmp = queue[front];
			return tmp;
		}

	}
	void add(int element) {
		if (!isFull())
		{
			rear++;
			queue[rear] = element;
		}
		else
			cout << "꽉참";
	}

};

int main(void)
{
	Queue A(100);
	A.add(2);
	A.add(3);
	A.add(4);
	cout << A.deletedt() << endl;
	cout << A.deletedt() << endl;
	cout << A.deletedt() << endl;
	return 0;
}