12week_5.cpp

#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
class BaseArray{
private:
	int capacity;
	int *mem;
protected:
	BaseArray(int capacity = 100){
		this->capacity = capacity;
		mem = new int[capacity];
	}
	~BaseArray(){ delete[] mem; }
	void put(int index, int val){
		mem[index] = val;
	}
	int get(int index){
		return mem[index];
	}
	int getCapacity(){
		return capacity;
	}
};
class MyQueue : public BaseArray{
	int index;
public:
	MyQueue(){ 
		index = 0;
		for (int i = 0; i < 100; i++){
			put(i, 0);
		}
	}
	MyQueue(int n){
		index = 0; 
		for (int i = 0; i < 100; i++){
			put(i, 0);
		}
	}
	void enqueue(int n){
		put(index, n);
		index++;
	}
	int capacity(){
		return getCapacity();
	}
	int dequeue(){
		put(index, 0);
		index = index - 1;
		return get(index);
	}
	int length(){
		return index;
	}
};

int main(){
	MyQueue mQ(100);
	int n;
	cout << "큐에 삽입할 5개의 정수를 입력하라.";
	for (int i = 0; i < 5; i++){
		cin >> n;
		mQ.enqueue(n);
	}
	cout << "큐의 용량:" << mQ.capacity() << ", 큐의 크기:" << mQ.length() << endl;
	cout << "큐의 원소를 순서대로 제거하여 출력한다>>";
	while (mQ.length() != 0){
		cout << mQ.dequeue() << ' ';
	}
	cout << endl << "큐의 현재 크기 : " << mQ.length() << endl;
}