[SW Expert Academy] [S/W 문제해결 기본] 8일차 - 암호문2

https://swexpertacademy.com/main/code/problem/problemDetail.do?problemLevel=3&contestProbId=AV14yIsqAHYCFAYD&categoryId=AV14yIsqAHYCFAYD&categoryType=CODE&problemTitle=&orderBy=PASS_RATE&selectCodeLang=ALL&select-1=3&pageSize=10&pageIndex=7

SW Expert Academy

 

import java.util.LinkedList;
import java.util.Scanner;

class Solution {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);

		for (int tc = 1; tc <= 10; tc++) {
			int n = sc.nextInt();

			LinkedList<Integer> list = new LinkedList<>();

			for (int i = 0; i < n; i++) {
				list.add(sc.nextInt());
			}

			int cmdC = sc.nextInt();

			for (int i = 0; i < cmdC; i++) {
				String cmd = sc.next();

				if (cmd.equals("I")) {

					int x = sc.nextInt();
					int y = sc.nextInt();

					for (int j = 0; j < y; j++) {
						list.add(x++, sc.nextInt());
					}

				} else {
					int x = sc.nextInt();
					int y = sc.nextInt();

					for (int j = 0; j < y; j++) {
						list.remove(x);
					}
				}

			}

			System.out.print("#" + tc + " ");
			for (int i = 0; i < 10; i++) {
				System.out.print(list.get(i)+" ");
			}
			System.out.println();

		}

	}
}

 

인덱스 관리만 잘해주고 앞에서부터 10개를 뽑으면 된다.

 

https://hessepark.tistory.com/508

[S/W 문제해결 기본] 8일차 - 암호문3 (D3)

참고