알고리즘45 [Java]프로그래머스 더 맵게 import java.io.*; import java.util.*; class Main { public static void main(String[] args) { int[] scoville = {0,1}; int K = 3; System.out.println(solution(scoville, K)); } public static int solution(int[] scoville, int K) { int answer = 0; PriorityQueue pQueue = new PriorityQueue(); if (scoville.length 2019. 4. 24. [Java]프로그래머스 카펫 ``` class Solution { public int[] solution(int brown, int red) { int[] answer = new int[2]; int sum = brown + red; for(int i = 3; i 2019. 4. 15. [Java]프로그래머스 위장 ``` import java.util.*; class Solution { public int solution(String[][] clothes) { int answer = 0; HashMap hm = new HashMap(); for(int i =0; i 2019. 4. 15. [Java]프로그래머스 쇠막대기 ``` import java.util.Stack; class Solution { public int solution(String arrangement) { int answer = 0; char[] arr = arrangement.toCharArray(); Stack st = new Stack(); for(int i = 0; i 2019. 4. 15. 이전 1 ··· 7 8 9 10 11 12 다음 728x90