SWExpert_3499_퍼펙트 셔플

문제 링크

https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AWGsRbk6AQIDFAVW&categoryId=AWGsRbk6AQIDFAVW&categoryType=CODE&problemTitle=%EC%85%94%ED%94%8C&orderBy=FIRST_REG_DATETIME&selectCodeLang=ALL&select-1=&pageSize=10&pageIndex=1

SW Expert Academy

 

 

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

public class Solution_3499 {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		
		int T = sc.nextInt();
		for(int t=0;t<T;t++) {
			Queue<String> q1 = new LinkedList<>();
			Queue<String> q2 = new LinkedList<>();
			
			int N = sc.nextInt();
			
			for(int i=0;i<N;i++)
				q2.offer(sc.next());
			
			
			//System.out.println(N);
			int num = (N%2)==0?N/2:(N/2+1);
			//System.out.println(num);
			for(int i=0;i<num;i++) {
				//System.out.println(q2.peek());
				q1.offer(q2.poll());
			}
			
			System.out.print("#"+(t+1)+" ");
			for(int i=0;i<N;i++) {
				if(i%2 == 0)
					System.out.print(q1.poll()+" ");
				else
					System.out.print(q2.poll()+" ");
			}
			System.out.println();
			/*q1.clear();
			q2.clear();*/
		}
	}
}

중간에 문제를 살짝 잘못 이해했당.