[SWEA] 1230. [S/W 문제해결 기본] List - 암호문3

문제

https://www.swexpertacademy.com/main/learn/course/lectureProblemViewer.do

SW Expert Academy

 

 

풀이

 

import java.util.*;
 
public class Solution {
    static Scanner scan = new Scanner(System.in);
    static int len, num;
    static LinkedList<Integer> list = new LinkedList<Integer>();;
 
    static void read_command() {
        num = scan.nextInt();
        for (int j = 0; j < num; j++) {
            int idx, p_num;
            char op = scan.next().charAt(0);
            switch (op) {
            case 'I': {
                idx = scan.nextInt();
                p_num = scan.nextInt();
                for (int k = 0; k < p_num; k++)// 삽입
                    list.add(idx + k, scan.nextInt());
                break;
            }
            case 'D': {
                idx = scan.nextInt();
                p_num = scan.nextInt();
                for (int k = 0; k < p_num; k++)
                    list.remove(idx);
                break;
            }
            case 'A': {
                p_num = scan.nextInt();
                for(int k=0;k<p_num;k++)
                    list.add(scan.nextInt());
                break;
            }
            }
        }
    }
 
    static void print_password() {
        for (int j = 0; j < 10; j++)
            System.out.print(list.remove() + " ");
        System.out.println();
    }
 
    static void solution() {
        for (int i = 1; i <= 10; i++) {
            len = scan.nextInt();
            // 암호문 입력
            for (int j = 0; j < len; j++)
                list.add(scan.nextInt());
 
            // 명렁어 입력
            read_command();
 
            // 10게 출력
            System.out.print("#" + i + " ");
            print_password();
 
            // 리스트 초기화
            list.removeAll(list);
        }
    }
 
    public static void main(String[] args) {
        // TODO Auto-generated method stub
        solution();
    }
}