[SWEA]#1230暗号文3
Link
https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV14zIwqAHwCFAYD&categoryId=AV14zIwqAHwCFAYD&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のようなソリューションで解決しました.
Link : https://velog.io/@kwonsc/SWEA-1228-%EC%95%94%ED%98%B8%EB%AC%B81
Reference
この問題について([SWEA]#1230暗号文3), 我々は、より多くの情報をここで見つけました https://velog.io/@kwonsc/SWEA-1230-암호문3テキストは自由に共有またはコピーできます。ただし、このドキュメントのURLは参考URLとして残しておいてください。
Collection and Share based on the CC Protocol