[SWEA] 1229 암호문2

KwonSC·2021년 11월 13일
0

SWEA - Java

목록 보기
20/26
post-thumbnail

https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV14yIsqAHYCFAYD&categoryId=AV14yIsqAHYCFAYD&categoryType=CODE


Code

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.LinkedList;
import java.util.StringTokenizer;

class Solution {
    public static void main(String args[]) throws Exception {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        for (int testCase = 1; testCase <= 10; testCase++) {
            StringTokenizer st = new StringTokenizer(br.readLine(), "");
            int N = Integer.parseInt(st.nextToken());
            st = new StringTokenizer(br.readLine(), " ");
            LinkedList<String> list = new LinkedList<>();
            for (int i = 0; i < N; i++) {
                list.add(st.nextToken());
            }
            st = new StringTokenizer(br.readLine(), " ");
            st.nextToken();
            st = new StringTokenizer(br.readLine(), " ");
            while (st.hasMoreTokens()) {
                char oper = st.nextToken().charAt(0);
                if (oper == 'I') {
                    int x = Integer.parseInt(st.nextToken());
                    int y = Integer.parseInt(st.nextToken());
                    for (int i = 0; i < y; i++) {
                        list.add(x + i, st.nextToken());
                    }
                }
                else if (oper == 'D') {
                    int x = Integer.parseInt(st.nextToken());
                    int y = Integer.parseInt(st.nextToken());
                    for (int i = 0; i < y; i++) {
                        list.remove(x);
                    }
                }
                else if (oper == 'A') {
                    int y = Integer.parseInt(st.nextToken());
                    for (int i = 0; i < y; i++) {
                        list.addLast(st.nextToken());
                    }
                }
            }
            System.out.printf("#%d ", testCase);
            for (int i = 0; i < 10; i++) {
                System.out.print(list.get(i) + " ");
            }
            System.out.println();
        }
    }
}

Solution

암호문 1과 같은 Solution으로 해결하였다.
Link : https://velog.io/@kwonsc/SWEA-1228-%EC%95%94%ED%98%B8%EB%AC%B81

0개의 댓글