์ „์ฒด ๊ธ€ 941
[programmers] ๋””ํŽœ์Šค ๊ฒŒ์ž„

๋ฌธ์ œhttps://school.programmers.co.kr/learn/courses/30/lessons/142085 ํ”„๋กœ๊ทธ๋ž˜๋จธ์ŠคSW๊ฐœ๋ฐœ์ž๋ฅผ ์œ„ํ•œ ํ‰๊ฐ€, ๊ต์œก์˜ Total Solution์„ ์ œ๊ณตํ•˜๋Š” ๊ฐœ๋ฐœ์ž ์„ฑ์žฅ์„ ์œ„ํ•œ ๋ฒ ์ด์Šค์บ ํ”„programmers.co.kr ๋ฌธ์ œ ํ’€์ด (Java)import java.util.*;class Solution { public int solution(int n, int k, int[] enemy) { int answer = enemy.length; PriorityQueue queue = new PriorityQueue(Collections.reverseOrder()); for (int i = 0; i 0) { n += queue.poll(); k -=..
๐ŸŒžAlgorithm/๐Ÿ”ฅprogrammers 2026.09.07

[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..
๐ŸŒžAlgorithm/๐Ÿ”ฅprogrammers 2026.08.28
1 2 3 4 ยทยทยท 95
๋”๋ณด๊ธฐ

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