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

programmers31

ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค[Java] - ๋ฒ ์ŠคํŠธ์•จ๋ฒ”(ํ•ด์‹œ) https://programmers.co.kr/learn/courses/30/lessons/42579 ์ฝ”๋”ฉํ…Œ์ŠคํŠธ ์—ฐ์Šต - ๋ฒ ์ŠคํŠธ์•จ๋ฒ” ์ŠคํŠธ๋ฆฌ๋ฐ ์‚ฌ์ดํŠธ์—์„œ ์žฅ๋ฅด ๋ณ„๋กœ ๊ฐ€์žฅ ๋งŽ์ด ์žฌ์ƒ๋œ ๋…ธ๋ž˜๋ฅผ ๋‘ ๊ฐœ์”ฉ ๋ชจ์•„ ๋ฒ ์ŠคํŠธ ์•จ๋ฒ”์„ ์ถœ์‹œํ•˜๋ ค ํ•ฉ๋‹ˆ๋‹ค. ๋…ธ๋ž˜๋Š” ๊ณ ์œ  ๋ฒˆํ˜ธ๋กœ ๊ตฌ๋ถ„ํ•˜๋ฉฐ, ๋…ธ๋ž˜๋ฅผ ์ˆ˜๋กํ•˜๋Š” ๊ธฐ์ค€์€ ๋‹ค์Œ๊ณผ ๊ฐ™์Šต๋‹ˆ๋‹ค. ์†ํ•œ ๋…ธ๋ž˜๊ฐ€ programmers.co.kr ํ‹€๋ฆฐ ์ฝ”๋“œ import java.util.ArrayList; import java.util.Arrays; import java.util.HashMap; import java.util.List; import java.util.Map; class Solution { public static int[] solution(String[] genres, int[] pla.. 2021. 6. 4.
ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค[Java] - H-Index(์ •๋ ฌ) programmers.co.kr/learn/courses/30/lessons/42747 ์ฝ”๋”ฉํ…Œ์ŠคํŠธ ์—ฐ์Šต - H-Index H-Index๋Š” ๊ณผํ•™์ž์˜ ์ƒ์‚ฐ์„ฑ๊ณผ ์˜ํ–ฅ๋ ฅ์„ ๋‚˜ํƒ€๋‚ด๋Š” ์ง€ํ‘œ์ž…๋‹ˆ๋‹ค. ์–ด๋А ๊ณผํ•™์ž์˜ H-Index๋ฅผ ๋‚˜ํƒ€๋‚ด๋Š” ๊ฐ’์ธ h๋ฅผ ๊ตฌํ•˜๋ ค๊ณ  ํ•ฉ๋‹ˆ๋‹ค. ์œ„ํ‚ค๋ฐฑ๊ณผ1์— ๋”ฐ๋ฅด๋ฉด, H-Index๋Š” ๋‹ค์Œ๊ณผ ๊ฐ™์ด ๊ตฌํ•ฉ๋‹ˆ๋‹ค. ์–ด๋–ค ๊ณผํ•™์ž๊ฐ€ ๋ฐœํ‘œ programmers.co.kr ์ฝ”๋“œ import java.util.Arrays; class Solution { public int solution(int[] citations) { int answer = 0; int size = citations.length; Arrays.sort(citations); int max = max(citations); for (int i = 0.. 2020. 12. 5.
ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค[Java] - ์‚ผ๊ฐ ๋‹ฌํŒฝ์ด programmers.co.kr/learn/courses/30/lessons/68645 ์ฝ”๋”ฉํ…Œ์ŠคํŠธ ์—ฐ์Šต - ์‚ผ๊ฐ ๋‹ฌํŒฝ์ด 5 [1,2,12,3,13,11,4,14,15,10,5,6,7,8,9] 6 [1,2,15,3,16,14,4,17,21,13,5,18,19,20,12,6,7,8,9,10,11] programmers.co.kr ์ฝ”๋“œ class Solution { public static int[] solution(int n) { if(n == 1) { return new int[] {1}; } int answerLen = 3; for(int i=3; i 2020. 9. 26.
[Programmers] - ๋‘ ๊ฐœ ๋ฝ‘์•„์„œ ๋”ํ•˜๊ธฐ programmers.co.kr/learn/courses/30/lessons/68644 ์ฝ”๋”ฉํ…Œ์ŠคํŠธ ์—ฐ์Šต - ๋‘ ๊ฐœ ๋ฝ‘์•„์„œ ๋”ํ•˜๊ธฐ programmers.co.kr ์ฝ”๋“œ import java.util.*; class Solution { public static int[] solution(int[] numbers) { int numbersLen = numbers.length; Set hashSet = new HashSet(); for(int i=0; i 2020. 9. 20.
ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค[Java] - (Level2)ํƒ€๊ฒŸ๋„˜๋ฒ„(dfs) https://programmers.co.kr/learn/courses/30/lessons/43165?language=java ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค ์ฝ”๋“œ ์ค‘์‹ฌ์˜ ๊ฐœ๋ฐœ์ž ์ฑ„์šฉ. ์Šคํƒ ๊ธฐ๋ฐ˜์˜ ํฌ์ง€์…˜ ๋งค์นญ. ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค์˜ ๊ฐœ๋ฐœ์ž ๋งž์ถคํ˜• ํ”„๋กœํ•„์„ ๋“ฑ๋กํ•˜๊ณ , ๋‚˜์™€ ๊ธฐ์ˆ  ๊ถํ•ฉ์ด ์ž˜ ๋งž๋Š” ๊ธฐ์—…๋“ค์„ ๋งค์นญ ๋ฐ›์œผ์„ธ์š”. programmers.co.kr ์ฝ”๋“œ class Solution { public static int answer = 0; public void dfs(int[] numbers, int target, int index){ // base case: if(index == numbers.length){ int sum = 0; for(int i=0; i์Œ์ˆ˜, ์Œ์ˆ˜->์–‘์ˆ˜ */ dfs(numbers, target, index+.. 2020. 3. 30.
ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค[Java] - (Level2)์‡ ๋ง‰๋Œ€๊ธฐ(์Šคํƒ/ํ) https://programmers.co.kr/learn/courses/30/lessons/42585 ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค ์ฝ”๋“œ ์ค‘์‹ฌ์˜ ๊ฐœ๋ฐœ์ž ์ฑ„์šฉ. ์Šคํƒ ๊ธฐ๋ฐ˜์˜ ํฌ์ง€์…˜ ๋งค์นญ. ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค์˜ ๊ฐœ๋ฐœ์ž ๋งž์ถคํ˜• ํ”„๋กœํ•„์„ ๋“ฑ๋กํ•˜๊ณ , ๋‚˜์™€ ๊ธฐ์ˆ  ๊ถํ•ฉ์ด ์ž˜ ๋งž๋Š” ๊ธฐ์—…๋“ค์„ ๋งค์นญ ๋ฐ›์œผ์„ธ์š”. programmers.co.kr ์ฝ”๋“œ import java.util.*; class Solution { public int solution(String arr) { int answer = 0; Stack s = new Stack(); for(int i=0; i ์Šคํƒ์— ์Œ“๊ธฐ if(arr.charAt(i) == '(') s.push('('); // ํ˜„์žฌ ๊ฐ’์ด ')' ์ธ ๊ฒฝ์šฐ -> ์ด์ „๊ฐ’์ด '('์ธ์ง€ ')'์ธ์ง€ ํŒ๋‹จ. else{ s.pop(); .. 2020. 3. 25.
ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค[Java] - (Level2)๋” ๋งต๊ฒŒ(Heap) https://programmers.co.kr/learn/courses/30/lessons/42626 ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค ์ฝ”๋“œ ์ค‘์‹ฌ์˜ ๊ฐœ๋ฐœ์ž ์ฑ„์šฉ. ์Šคํƒ ๊ธฐ๋ฐ˜์˜ ํฌ์ง€์…˜ ๋งค์นญ. ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค์˜ ๊ฐœ๋ฐœ์ž ๋งž์ถคํ˜• ํ”„๋กœํ•„์„ ๋“ฑ๋กํ•˜๊ณ , ๋‚˜์™€ ๊ธฐ์ˆ  ๊ถํ•ฉ์ด ์ž˜ ๋งž๋Š” ๊ธฐ์—…๋“ค์„ ๋งค์นญ ๋ฐ›์œผ์„ธ์š”. programmers.co.kr ์ฝ”๋“œ import java.util.*; class Solution { public int solution(int[] scoville, int K) { int answer = 0; Queue pq = new PriorityQueue(); // ์šฐ์„ ์ˆœ์œ„ ํ์— ๋ฐฐ์—ด๊ฐ’ ์ €์žฅ for(int i : scoville) pq.offer(i); // ์šฐ์„ ์ˆœ์œ„ ํ์— ์Šค์ฝ”๋นŒ์ง€์ˆ˜ K๋ณด๋‹ค ๊ฐ’์ด ์ž‘์„๋•Œ ๋ฐ˜๋ณต while(pq.peek.. 2020. 3. 20.
ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค[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/12977 ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค ์ฝ”๋“œ ์ค‘์‹ฌ์˜ ๊ฐœ๋ฐœ์ž ์ฑ„์šฉ. ์Šคํƒ ๊ธฐ๋ฐ˜์˜ ํฌ์ง€์…˜ ๋งค์นญ. ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค์˜ ๊ฐœ๋ฐœ์ž ๋งž์ถคํ˜• ํ”„๋กœํ•„์„ ๋“ฑ๋กํ•˜๊ณ , ๋‚˜์™€ ๊ธฐ์ˆ  ๊ถํ•ฉ์ด ์ž˜ ๋งž๋Š” ๊ธฐ์—…๋“ค์„ ๋งค์นญ ๋ฐ›์œผ์„ธ์š”. programmers.co.kr ์ฝ”๋“œ class Solution { public static boolean isPrime(int num){ if(num == 2) return true; for(int i=2; i 2020. 3. 18.
ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค[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.
๋ฐ˜์‘ํ˜•