[백준][Java] 2346번 풍선 터뜨리기 (덱, linkedlist)

[백준][Java] 2346번 풍선 터뜨리기 (덱, linkedlist)

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56

import java.io.BufferedReader; import java.io.BufferedWriter; import java.io.IOException; import java.io.InputStreamReader; import java.io.OutputStreamWriter; import java.util.LinkedList; public class Main { private static BufferedReader br = new BufferedReader( new InputStreamReader( System . in )); private static BufferedWriter bw = new BufferedWriter( new OutputStreamWriter( System . out )); public static void main( String [] args) throws IOException{ int N = stoi(br.readLine()); StringBuilder sb = new StringBuilder(); int [] paperArr = new int [N]; String [] str = br.readLine(). split ( " " ); for ( int i = 0 ; i < N; i + + ) paperArr[i] = stoi(str[i]); LinkedList < Integer > list = new LinkedList < > (); for ( int i = 1 ; i < = N; i + + ) list. add (i); int currIdx = 0 ; while ( true ) { int currValue = list.remove(currIdx); sb.append(currValue + " " ); if (list.isEmpty()) break ; int paper = paperArr[ - - currValue]; //paper가 음수일 때만 잘 처리해주면 됨.. if (paper > 0 ) { - - currIdx; currIdx = (currIdx + paper)%list.size(); } else { paper = Math.abs(paper); paper = list.size() - (paper%list.size()); currIdx = (currIdx + paper)%list.size(); } } System . out . println (sb. toString ()); // bw.write(""); // bw.flush(); // bw.close(); } private static int stoi( String input) { return Integer. parseInt (input); } } Colored by Color Scripter

from http://aig2029.tistory.com/334 by ccl(A) rewrite - 2021-10-12 20:01:00