[백준 알고리즘] Q2675 문자열 반복

1. Java 구현

           
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		/* 2018.08.08 */
		Scanner sc = new Scanner(System.in);
		int caseNum = Integer.parseInt(getInput(sc));
		int[] loopArr = new int[caseNum];
		String[] strArr = new String[caseNum];
		getVariable(sc, caseNum, loopArr, strArr);
		
		printResult(caseNum, strArr, loopArr);
	}
	
	public static String getInput(Scanner sc) {
		return sc.nextLine();
	}
	
	public static void getVariable(Scanner sc, int caseNum, int[] intArr, String[] strArr) {
		for(int i = 0; i < caseNum; i++) {
			String input = getInput(sc);
			intArr[i] = Integer.parseInt(splitStr(input, 0));
			strArr[i] = splitStr(input, 1);
		}
	}
	
	public static String splitStr(String str, int idx) {
		return str.split(" ")[idx];
	}
	
	public static void setResult(char[] arr, String inputStr, int inputNum) {
		int index = 0;
		
		for(int i = 1; i <= arr.length; i++) {
			arr[i-1] = inputStr.charAt(index);
			index = i % inputNum == 0 ? (index + 1) : index;
		}
	}
	
	public static void getResult(char[] arr) {
		for(int i = 0; i < arr.length; i++) {
			System.out.print(arr[i]);
		}
		System.out.println("");
	}
	
	public static void printResult(int caseNum,  String[] strArr, int[] intArr) {
		char[][] charArr = null;
		for(int i = 0; i < caseNum; i++) {
			charArr = new char[caseNum][intArr[i] * strArr[i].length()];
			
			setResult(charArr[i], strArr[i], intArr[i]);
			getResult(charArr[i]);
		}
	}

}