백준 10866 덱 | 자바 java | BufferedReader BufferedWriter

 

이번 포스팅은 백준 10866번 덱입니다.

아래 url를 클릭하시면 백준 사이트에서 문제를 볼 수 있습니다.

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

10866번: 덱

 

 

 

기본 알고리즘

• 구현
• 자료구조
• 덱

 

반응형

 

전체 코드

 

import java.io.*;
import java.util.StringTokenizer;
 
 
public class Main{
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
        String input="", output="";
        StringTokenizer st = new StringTokenizer(input);
        int n=0;
 
        input = br.readLine();
        st = new StringTokenizer(input);
        n = Integer.parseInt(st.nextToken());
        
        int[] deque = new int[n];
        int size = 0;
    
 
        for(int i=0; i<n; i++){
            input = br.readLine();
            st = new StringTokenizer(input);
            output="";
 
            switch (st.nextToken()) {
                case "push_front":
                    int[] deque2 = new int[size];
                    for(int j=0; j<size; j++){
                        deque2[j]=deque[j];
                    }
 
                    deque[0]=Integer.parseInt(st.nextToken());
 
                    int idx=0;
                    for(int k=1; k<size+1; k++){
                        deque[k] = deque2[idx++];
                    }
                    size++;
 
                    break;
 
                case "push_back":
                    deque[size]=Integer.parseInt(st.nextToken());
                    size++;
 
                    break;
 
                case "pop_front":
                    if(size==0){
                        output = String.valueOf(-1);
                    } else {
                        output = String.valueOf(deque[0]);
 
                        int[] deque3 = new int[size-1];
                        int size3=0;
                        for(int j=1; j<size; j++){
                            deque3[size3]=deque[j];
                            size3++;
                        }
 
                        for(int k=0; k<size-1; k++){
                            deque[k] = deque3[k];
                        }
 
                        size--;
                    }
                    
                    break;
 
                case "pop_back":
                    if(size==0){
                        output = String.valueOf(-1);
                    } else {
                        output = String.valueOf(deque[size-1]);
                        size--;
                    }
                    
                    break;
 
                case "size":
                    output = String.valueOf(size);
                    
                    break;
 
                case "empty":
                    if(size==0){
                        output = String.valueOf(1);
                    } else {
                        output = String.valueOf(0);
                    }
 
                    break;
 
                case "front":
                    if(size==0){
                        output = String.valueOf(-1);
                    } else {
                        output = String.valueOf(deque[0]);
                    }
 
                    break;
 
                case "back":
                    if(size==0){
                        output = String.valueOf(-1);
                    } else {
                        output = String.valueOf(deque[size-1]);
                    }
 
                    break;     
            
                default:
                    break;
            }
 
            if(output.length()>0){
                bw.write(output);
                bw.newLine();
                bw.flush();
            }
        }
 
        bw.flush();
        bw.close();
    }
}