[알고리즘] SW Expert Academy 3499. 퍼펙트 셔플

 

 

 

https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AWGsRbk6AQIDFAVW 

SW Expert Academy

 

 

import java.util.Scanner;

public class Solution {

   public static void main(String[] args) {
      Scanner sc = new Scanner(System.in);
     
      
      int T = sc.nextInt();
      
      for(int t=1; t<=T; t++) {
    	  int card = sc.nextInt();
    	  StringBuilder sb = new StringBuilder();
    	  int preCard = (card%2==0) ? card/2 : card/2 +1;
    	  int postCard = card-preCard;
    	  
    	  String[] sPre = new String[preCard];
    	  String[] sPost = new String[postCard];
    	  
    	  for(int i=0; i<preCard; i++) {
    		  sPre[i] = sc.next();
    		  
    	  }
    	  
    	  for(int i=0; i<postCard; i++) {
    		  sPost[i] = sc.next();
    	  }
    	  
    	  sb.append("#").append(t).append(" ");
    	  
    	  for(int i=0; i<card/2; i++) {
    		  sb.append(sPre[i]).append(" ").append(sPost[i]).append(" ");
    	  }
    	  
    	  if(card%2!=0) sb.append(sPre[sPre.length-1]);
    	  
    	  System.out.println(sb.toString());

      }
      
   }
   
}