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

์žฌ๊ท€2

ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค[Java] - (Level3)ํ•˜๋…ธ์ด์˜ ํƒ‘ https://programmers.co.kr/learn/courses/30/lessons/12946 ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค ์ฝ”๋“œ ์ค‘์‹ฌ์˜ ๊ฐœ๋ฐœ์ž ์ฑ„์šฉ. ์Šคํƒ ๊ธฐ๋ฐ˜์˜ ํฌ์ง€์…˜ ๋งค์นญ. ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค์˜ ๊ฐœ๋ฐœ์ž ๋งž์ถคํ˜• ํ”„๋กœํ•„์„ ๋“ฑ๋กํ•˜๊ณ , ๋‚˜์™€ ๊ธฐ์ˆ  ๊ถํ•ฉ์ด ์ž˜ ๋งž๋Š” ๊ธฐ์—…๋“ค์„ ๋งค์นญ ๋ฐ›์œผ์„ธ์š”. programmers.co.kr ์ฝ”๋“œ class Solution { public static int[][] answer; public static int x = 0; // n๊ฐœ๋ฅผ other๊ธฐ๋‘ฅ์„ ์‚ฌ์šฉํ•ด from -> to๋กœ ์˜ฎ๊ธฐ๊ธฐ public static void hanoi(int n, int from, int other, int to){ if(n == 0) return; hanoi(n-1, from, to, other); // n-1๊ฐœ์˜ .. 2020. 3. 17.
ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค[Java] - (Level2)ํ”ผ๋ณด๋‚˜์น˜ ์ˆ˜(์žฌ๊ท€ , ๋น„์žฌ๊ท€DP) https://programmers.co.kr/learn/courses/30/lessons/12945 ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค ์ฝ”๋“œ ์ค‘์‹ฌ์˜ ๊ฐœ๋ฐœ์ž ์ฑ„์šฉ. ์Šคํƒ ๊ธฐ๋ฐ˜์˜ ํฌ์ง€์…˜ ๋งค์นญ. ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค์˜ ๊ฐœ๋ฐœ์ž ๋งž์ถคํ˜• ํ”„๋กœํ•„์„ ๋“ฑ๋กํ•˜๊ณ , ๋‚˜์™€ ๊ธฐ์ˆ  ๊ถํ•ฉ์ด ์ž˜ ๋งž๋Š” ๊ธฐ์—…๋“ค์„ ๋งค์นญ ๋ฐ›์œผ์„ธ์š”. programmers.co.kr ์ฝ”๋“œ1(๋น„์žฌ๊ท€, DP) class Solution { public int solution(int n) { int[] arr = new int[100001]; arr[1] = 1; arr[2] = 1; for(int i=3; i 2020. 3. 16.
๋ฐ˜์‘ํ˜•

ํ‹ฐ์Šคํ† ๋ฆฌํˆด๋ฐ”