์ „์ฒด ๊ธ€ 940

[programmers] ๋ฆฌ์ฝ”์ณ‡ ๋กœ๋ด‡

๋ฌธ์ œhttps://school.programmers.co.kr/learn/courses/30/lessons/169199 ํ”„๋กœ๊ทธ๋ž˜๋จธ์ŠคSW๊ฐœ๋ฐœ์ž๋ฅผ ์œ„ํ•œ ํ‰๊ฐ€, ๊ต์œก์˜ Total Solution์„ ์ œ๊ณตํ•˜๋Š” ๊ฐœ๋ฐœ์ž ์„ฑ์žฅ์„ ์œ„ํ•œ ๋ฒ ์ด์Šค์บ ํ”„programmers.co.kr ๋ฌธ์ œ ํ’€์ด (Java)import java.util.*;class Solution { public int solution(String[] board) { int answer = 0; char arr[][] = new char[board.length][board[0].length()]; int x = 0, y = 0; for (int i = 0; i queue = new LinkedList(); queue.add(new int[] { x..

[programmers] ๋Œ€์ถฉ ๋งŒ๋“  ์žํŒ

๋ฌธ์ œhttps://school.programmers.co.kr/learn/courses/30/lessons/160586 ํ”„๋กœ๊ทธ๋ž˜๋จธ์ŠคSW๊ฐœ๋ฐœ์ž๋ฅผ ์œ„ํ•œ ํ‰๊ฐ€, ๊ต์œก์˜ Total Solution์„ ์ œ๊ณตํ•˜๋Š” ๊ฐœ๋ฐœ์ž ์„ฑ์žฅ์„ ์œ„ํ•œ ๋ฒ ์ด์Šค์บ ํ”„programmers.co.kr ๋ฌธ์ œ ํ’€์ด (Java)import java.util.*;class Solution { public int[] solution(String[] keymap, String[] targets) { int[] answer = new int[targets.length]; HashMap map = new HashMap(); for (int i = 0; i HashMap์— ๊ฐ ๋ฌธ์ž์—ด์„ ๋ช‡ ๋ฒˆ ๋ˆŒ๋Ÿฌ์•ผ ์ž‘์„ฑํ•  ์ˆ˜ ์žˆ๋Š”์ง€ ๋ฏธ๋ฆฌ ๊ตฌํ•ด๋‘” ๋’ค targets๋ฅผ ์ˆœ..