silvergoni.builder()

https://programmers.co.kr/learn/courses/30/lessons/42748 1. 2022.04.08 시도 소요시간: 7분 import java.util.*; class Solution { public int[] solution(int[] array, int[][] commands) { int index=0; int[] answer = new int[commands.length]; for(int i=0; i

https://programmers.co.kr/learn/courses/30/lessons/42628 1. 2022.04.08 시도 소요시간: 16분 import java.util.*; class Solution { public int[] solution(String[] operations) { PriorityQueue pq = new PriorityQueue(); for (int i=0 ;i -1) { int number = Integer.parseInt(each.replace("I ", "")); pq.offer(number); } else if (each.indexOf("D 1") > -1) { PriorityQueue other = new PriorityQueue(); for (int j=0; j..

https://programmers.co.kr/learn/courses/30/lessons/42626 1. 2022.04.08 시도 소요시간: 8분 import java.util.*; class Solution { public int solution(int[] scoville, int K) { PriorityQueue pq = new PriorityQueue(); for (int i=0; i 1 && pq.peek() < K) { int min = pq.poll(); int min2 = pq.poll(); pq.offer(min + (min2 *2)); counter++; } if (pq.peek() < K) { return -1; } return counter; } } 풀이 접근 과정 PriorityQ..

https://programmers.co.kr/learn/courses/30/lessons/42584 1. 2022.04.08 시도 소요시간: 49분 import java.util.*; class PriceTag { int index; int price; PriceTag(int index, int price) { this.index = index; this.price = price; } public String toString() { return "("+index+":"+price+")"; } } class Solution { public int[] solution(int[] prices) { int[] answer = new int[prices.length]; PriorityQueue pq = new ..

https://programmers.co.kr/learn/courses/30/lessons/42583 1. 2022.04.08 시도 소요시간: 45분 import java.util.*; class Solution { public int solution(int bridge_length, int weight, int[] truck_weights) { int timer = 0; int sum_of_truck_weight = 0; Queue queue = new LinkedList(); Map timerMapByTruck = new HashMap(); for (int truckIndex=0; truckIndex weight) { int firstTruckIndex = queue.poll(); int elapse..

https://leetcode.com/problems/top-k-frequent-elements/ 2. 2022.04.08 시도 소요시간: 7분 class Solution { public int[] topKFrequent(int[] nums, int k) { Map countMap = new HashMap(); for (int i=0; i { return o1.getValue().compareTo(o2.getValue()) * -1; }); int counter=0; int[] ret = new int[k]; for (Map.Entry each: list) { ret[counter++] = each.getKey(); if (counter == k) { break; } } return ret; } } 풀이..

https://programmers.co.kr/learn/courses/30/lessons/42587 1. 2022.04.08 시도 소요시간: 50분 import java.util.*; class LocationValue { public int index; public int value; LocationValue(int index, int value) { this.index = index; this.value = value; } } class Solution { public int solution(int[] priorities, int location) { Queue queue = new LinkedList(); for(int i=0; i

https://programmers.co.kr/learn/courses/30/lessons/42586 1. 2022.04.07 시도 소요시간: 14분(5분 문제 해석 및 구상, 9분 풀이), 13분(13분 코딩, queue) import java.util.*; class Solution { public int[] solution(int[] progresses, int[] speeds) { List ret = new ArrayList(); for (int i=0; i

https://programmers.co.kr/learn/courses/30/lessons/42579 1. 2022.04.07 시도 소요시간: 44분 import java.util.*; import java.util.Map.Entry; class Solution { public int[] solution(String[] genres, int[] plays) { Map songMap = new HashMap(); Map genreMap = new HashMap(); for(int i=0; i { int ret = o1.getValue().compareTo(o2.getValue()) * -1; if (ret == 0) { return o1.getKey().compareTo(o2.getKey()); } ret..

https://programmers.co.kr/learn/courses/30/lessons/42578 1. 2022.04.07 시도 소요시간: 못품 import java.util.*; class Solution { public int solution(String[][] clothes) { Map stuff = new HashMap(); for (String[] cloth: clothes) { stuff.put(cloth[1], stuff.getOrDefault(cloth[1], 0) + 1); } int answer = 1; for (Integer each: stuff.values()) { answer *= (each+1); } return answer-1; } } 풀이 접근 과정 복잡하게 생각했따.. ..