백준 10845번. 큐(c++) / Queue

본인은 c++의 큐 라이브러리를 사용하지 않고 직접 구현하여 문제를 풀었다.

 

 

코드 첨부

// 큐
#include <iostream>
using namespace std;
 
int queue[10001] = {0, };
int front = -1, rear = -1;
int n, m;
string s;
 
void insert(int data)
{
    if(front==-1){
        front = 0;
    }
    queue[++rear] = data;
}
 
void del()
{
    cout<<queue[front]<<"\n";
    front++;
}
 
void empty()
{
    if(front==-1 || front>rear){
        cout<<"1"<<"\n";
    }else{
        cout<<"0"<<"\n";
    }
}
 
int main()
{
    cin>>n;
    for(int i=0; i<n; i++){
        cin>>s;
        if(s=="push"){
            cin>>m;
            insert(m);
        }else if(s=="front"){
            if(front==-1 || front>rear){
                cout<<"-1"<<"\n";
            }else{
                cout<<queue[front]<<"\n";
            }
        }else if(s=="back"){
            if(front==-1 || front>rear){
                cout<<"-1"<<"\n";
            }else{
                cout<<queue[rear]<<"\n";
            }
        }else if(s=="size"){
            if(front==-1 || front>rear){
                cout<<"0"<<"\n";
            }else{
                cout<<rear-front+1<<"\n";
            }
        }else if(s=="empty"){
            empty();
        }else if(s=="pop"){
            if(front==-1 || front>rear){
                cout<<"-1"<<"\n";
            }else{
                del();
            }
        }
    }
 
    return 0;
}

 

문제 첨부

https://www.acmicpc.net/problem/10845

10845번: 큐

 

github 첨부

https://github.com/jungahshin/algorithm/blob/master/c:c%2B%2B/10845.cpp

jungahshin/algorithm