silvergoni.builder()

https://programmers.co.kr/learn/courses/30/lessons/42839 1. 2022.04.09 시도 소요시간: 14분 import java.util.*; class Solution { Set answerSet = new HashSet(); public int solution(String numbers) { boolean[] visited = new boolean[numbers.length()]; recursion(numbers.toCharArray(), visited, ""); return answerSet.size(); } private void recursion(char[] numbers, boolean[] visited, String text) { if ("".equ..

https://programmers.co.kr/learn/courses/30/lessons/42840 1. 2022.04.09 시도 소요시간: 26분 import java.util.*; class User { public int index; public int sum; User(int index, int sum) { this.index = index; this.sum = sum; } public String toString(){ return index+":"+sum; } } class Solution { private int[] p1 = new int[]{1,2,3,4,5}; private int[] p2 = new int[]{2, 1, 2, 3, 2, 4, 2, 5}; private int[] p3 =..

https://programmers.co.kr/learn/courses/30/lessons/42747 1. 2022.04.09 시도 소요시간: 7분 import java.util.*; class Solution { public int solution(int[] citations) { PriorityQueue pq = new PriorityQueue(); for (int i=0; i 0 && pq.size() > pq.peek()) { pq.poll(); } return pq.size(); } } 풀이 접근 과정 PriorityQueue에 넣어서 h를 만족할 때까지 poll한다. 느낀점 pq를 while문에 돌릴때는 size()를 꼭 확인하자. 알고리즘 정리노트: .leetcode(알고리즘 문제풀이 접근)

https://programmers.co.kr/learn/courses/30/lessons/42746 1. 2022.04.08 시도 소요시간: 못품 // 풀이 접근 과정 string으로 변환해서 푼다. 느낀점 String의 compareTo를 잘 이용하면 좋다. 0의 예외처리를 못해서 결국 못 풀었다. 알고리즘 정리노트: .leetcode(알고리즘 문제풀이 접근)

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/42627 1. 2022.04.08 시도 소요시간: 74분 //9:31 ~ import java.util.*; class Job { public int start; public int duration; public int diff=0; Job(int start, int duration) { this.start = start; this.duration = duration; } public String toString() { return start + ":" + duration + "("+diff+")"; } } class Solution { public int solution(int[][] jobs) { Priori..

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..