๋ณธ๋ฌธ ๋ฐ”๋กœ๊ฐ€๊ธฐ
๋ฐ˜์‘ํ˜•

์œˆํ„ฐ์ฝ”๋”ฉ3

ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค[Java] - (Level2)์Šคํ‚ฌํŠธ๋ฆฌ https://programmers.co.kr/learn/courses/30/lessons/49993 ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค ์ฝ”๋“œ ์ค‘์‹ฌ์˜ ๊ฐœ๋ฐœ์ž ์ฑ„์šฉ. ์Šคํƒ ๊ธฐ๋ฐ˜์˜ ํฌ์ง€์…˜ ๋งค์นญ. ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค์˜ ๊ฐœ๋ฐœ์ž ๋งž์ถคํ˜• ํ”„๋กœํ•„์„ ๋“ฑ๋กํ•˜๊ณ , ๋‚˜์™€ ๊ธฐ์ˆ  ๊ถํ•ฉ์ด ์ž˜ ๋งž๋Š” ๊ธฐ์—…๋“ค์„ ๋งค์นญ ๋ฐ›์œผ์„ธ์š”. programmers.co.kr ์ฝ”๋“œ class Solution { public static int solution(String skill, String[] skill_trees) { int answer = 0; for(int i=0; i C๋ฅผ๋ฐฐ์šฐ๊ณ  B๋ฅผ ๋ฐฐ์›Œ์•ผํ•จ */ else if(index < skill.indexOf(s)){ check = false; break; } } if(check)answer ++; } return answer;.. 2020. 3. 19.
ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค[Java] - (Level2)์˜์–ด ๋๋ง์ž‡๊ธฐ https://programmers.co.kr/learn/courses/30/lessons/12981 ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค ์ฝ”๋“œ ์ค‘์‹ฌ์˜ ๊ฐœ๋ฐœ์ž ์ฑ„์šฉ. ์Šคํƒ ๊ธฐ๋ฐ˜์˜ ํฌ์ง€์…˜ ๋งค์นญ. ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค์˜ ๊ฐœ๋ฐœ์ž ๋งž์ถคํ˜• ํ”„๋กœํ•„์„ ๋“ฑ๋กํ•˜๊ณ , ๋‚˜์™€ ๊ธฐ์ˆ  ๊ถํ•ฉ์ด ์ž˜ ๋งž๋Š” ๊ธฐ์—…๋“ค์„ ๋งค์นญ ๋ฐ›์œผ์„ธ์š”. programmers.co.kr ์ฝ”๋“œ import java.util.*; class Solution { public int[] solution(int n, String[] words) { int[] answer = new int[2]; List list = new ArrayList(); boolean flag = true; for(int i=0; i0 && words[i-1].charAt(words[i-1].length()-1) != wor.. 2020. 3. 18.
ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค[Java] - (Level3)๋ฐฉ๋ฌธ ๊ธธ์ด https://programmers.co.kr/learn/courses/30/lessons/49994 ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค ์ฝ”๋“œ ์ค‘์‹ฌ์˜ ๊ฐœ๋ฐœ์ž ์ฑ„์šฉ. ์Šคํƒ ๊ธฐ๋ฐ˜์˜ ํฌ์ง€์…˜ ๋งค์นญ. ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค์˜ ๊ฐœ๋ฐœ์ž ๋งž์ถคํ˜• ํ”„๋กœํ•„์„ ๋“ฑ๋กํ•˜๊ณ , ๋‚˜์™€ ๊ธฐ์ˆ  ๊ถํ•ฉ์ด ์ž˜ ๋งž๋Š” ๊ธฐ์—…๋“ค์„ ๋งค์นญ ๋ฐ›์œผ์„ธ์š”. programmers.co.kr ์ฝ”๋“œ class Solution { // U,D,R,L - ์œ„,์•„๋ž˜,์˜ค๋ฅธ์ชฝ,์™ผ์ชฝ ์ˆœ public static int[] dx = {0, 0, 1, -1}; public static int[] dy = {-1, 1, 0, 0}; // ๋งต์˜ ํฌ๊ธฐ = -5 ~ 5๊นŒ์ง€์ด๋ฏ€๋กœ 11x11 public static boolean[][][][] visit = new boolean[11][11][11][11]; public .. 2020. 3. 17.
๋ฐ˜์‘ํ˜•