Notice
Recent Posts
Recent Comments
Creative Code
main.cpp(queue) 본문
※main.cpp파일
#include <iostream>
#include "queue.h"
int main(void)
{
Queue s1(10), s2(100);
s1.push(100);
s1.push(200);
std::cout << "s1 1st pop() : " << s1.pop() << std::endl;
s1.push(300);
std::cout << "s1 2nd pop() : " << s1.pop() << std::endl;
std::cout << "s1 3rd pop() : " << s1.pop() << std::endl;
s2.push(900);
s2.push(800);
std::cout << "s2 1st pop() : " << s2.pop() << std::endl;
s2.push(700);
std::cout << "s2 2nd pop() : " << s2.pop() << std::endl;
std::cout << "s2 3rd pop() : " << s2.pop() << std::endl;
return 0;
}
※queue.h파일
#ifndef QUEUE_H
#define QUEUE_H
class Queue {
private:
int *array;
int rear;
int front;
int size;
public:
Queue(int size);
~Queue();
void push(int data);
int pop();
};
#endif
※queue.cpp파일
#include <cstdlib>
#include "queue.h"
Queue::Queue(int size)
{
this->array = new int[size];
this->size = size;
this->rear = 0;
this->front = 0;
}
Queue::~Queue()
{
delete[] this->array;
}
void Queue::push(int data)
{
this->array[this->rear] = data;
++this->rear;
}
int Queue::pop()
{
int index = this->front;
++this->front;
return this->array[index];
}
'C++ Programming' 카테고리의 다른 글
main.cpp(Rational 사칙연산) (0) | 2023.08.30 |
---|---|
main.cpp(complex 연산) (0) | 2023.08.30 |
main.cpp(complex 클래스) (0) | 2023.08.30 |
main.cpp(linked list) (0) | 2023.08.29 |
main.cpp(스택) (0) | 2023.08.29 |