[java] SWEA - 암호문1

[문제링크 - SWEA - 암호문1] https://swexpertacademy.com/main/code/problem/problemDetail.do?problemLevel=3&contestProbId=AV14w-rKAHACFAYD&categoryId=AV14w-rKAHACFAYD&categoryType=CODE&problemTitle=&orderBy=INQUERY_COUNT&selectCodeLang=ALL&select-1=3&pageSize=10&pageIndex=2

• 리스트의 add함수를 사용하면 쉽게 풀 수 있다.
• 단, add할 때 인덱스의 값은 0부터 시작하므로 3번째 위치에 넣고 싶다면 2가 들어가게끔 해야한다.

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.List;
import java.util.StringTokenizer;

public class Solution {
	public static void main(String[] args) throws IOException{
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		//BufferedReader br = new BufferedReader(new FileReader("input1228.txt"));
		StringBuilder sb = new StringBuilder();
		StringTokenizer st;
		
		for(int t=1; t<=10; t++) {
			List<String> list = new ArrayList<>();
			
			int n = Integer.parseInt(br.readLine());
			st = new StringTokenizer(br.readLine());
			for(int i=0; i<n; i++) {
				list.add(st.nextToken());
			}
			
			int m = Integer.parseInt(br.readLine());
			st = new StringTokenizer(br.readLine());
			for(int i=0; i<m; i++) {
				String I = st.nextToken();
				int x = Integer.parseInt(st.nextToken());
				int y = Integer.parseInt(st.nextToken());
				for(int j=0; j<y; j++) {
					list.add(x+j, st.nextToken());
				}
			}
			
			sb.append("#" + t + " ");
			
			for(int i=0; i<10; i++) {
				sb.append(list.get(i) + " ");
			}
			
			sb.append("\n");
		}
		
		System.out.println(sb);
	}
}