๋ณธ๋ฌธ ๋ฐ”๋กœ๊ฐ€๊ธฐ
Algorithm

[SW Expert Academy] - (D3)5356. ์˜์„์ด์˜ ์„ธ๋กœ๋กœ ๋งํ•ด์š”

by ์ฃผ๋ฐœ2 2020. 6. 14.
๋ฐ˜์‘ํ˜•

https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AWVWgkP6sQ0DFAUO&categoryId=AWVWgkP6sQ0DFAUO&categoryType=CODE

 

SW Expert Academy

SW ํ”„๋กœ๊ทธ๋ž˜๋ฐ ์—ญ๋Ÿ‰ ๊ฐ•ํ™”์— ๋„์›€์ด ๋˜๋Š” ๋‹ค์–‘ํ•œ ํ•™์Šต ์ปจํ…์ธ ๋ฅผ ํ™•์ธํ•˜์„ธ์š”!

swexpertacademy.com

 

 

 

 

์ฝ”๋“œ

import java.util.Scanner;

public class Solution {

	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);

		int t = scan.nextInt();
		

		for(int tc=1; tc<=t; tc++) {
			String result = "";	// ๊ฒฐ๊ณผ ๊ฐ’
			char[][] cArr = new char[5][15];

			for(int i=0; i<cArr.length; i++) {
				String str = scan.next();
//				cArr[i] = str.toCharArray();
				for(int j=0; j<str.length(); j++) {
					cArr[i][j] = str.charAt(j);
				}
			}

			for(int i=0; i<15; i++) {
				for(int j=0; j<5; j++) {
					if(cArr[j][i] != 0) {
						result += cArr[j][i];
					}
				}
			}
			System.out.println("#" + tc + " " + result);
		}

		scan.close();
	}

}

ํ’€์ด

๋ฌธ์ œ์—์„œ ๋‹จ์–ด์˜ ๊ฐฏ์ˆ˜๋Š” 5๊ฐœ์ด๊ณ , ๊ฐ ๋‹จ์–ด์˜ ๊ธธ์ด๋Š” 1~15์ด๋‹ค. 

๋”ฐ๋ผ์„œ char 2์ฐจ์› ๋ฐฐ์—ด์„ char[5][15] ๋กœ ์„ค์ •ํ–ˆ๋‹ค.

์„ธ๋กœ๋กœ ๊ฐ’์„ ์ฝ๊ณ , ๋‹จ์–ด๋งˆ๋‹ค ๊ธธ์ด๊ฐ€ ๋‹ค๋ฅผ ์ˆ˜ ์žˆ์œผ๋ฏ€๋กœ char ๋ฐฐ์—ด์˜ ๊ฐ’์ด 0์ด ์•„๋‹๊ฒฝ์šฐ, ๋ฌธ์ž๋ฅผ ์ถ”๊ฐ€ํ•ด์ค€๋‹ค.

์„ธ๋กœ๋กœ ์ฝ์œผ๋ฏ€๋กœ ๊ฐ’์€ cArr[j][i] ์ด ๋œ๋‹ค.

 

 

๋ฐ˜์‘ํ˜•

๋Œ“๊ธ€

๐Ÿ”HALO