silvergoni.builder()

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; } } 풀이 접근 과정 복잡하게 생각했따.. ..

https://programmers.co.kr/learn/courses/30/lessons/42577 1. 2022.04.01 시도 소요시간: - 분(기억안남) import java.util.*; class Box { Box[] boxes = new Box[10]; boolean isPhone; } class Solution { public boolean solution(String[] phone_book) { Arrays.sort(phone_book); Box wholeBox = new Box(); for (String each: phone_book) { Box temp = wholeBox; for (int i=0; i

https://programmers.co.kr/learn/courses/30/lessons/42576 1. 2022.04.01 시도 소요시간: -분(기억이 안남ㅠ) import java.util.Arrays; class Solution { public String solution(String[] participant, String[] completion) { String answer = ""; Arrays.sort(participant); Arrays.sort(completion); for (int i=0; i

https://leetcode.com/problems/unique-email-addresses/ 1. 2022.04.01 시도 소요시간: 10분(4분 문제 읽기, 6분 코딩) class Solution { public int numUniqueEmails(String[] emails) { Set ret = new HashSet(); for (String email: emails) { String rawLocalName = email.split("@")[0]; String domainName = email.split("@")[1]; String removeAfterPlus = rawLocalName.split("\\+")[0]; String removeDots = removeAfterPlus.replace(..

https://leetcode.com/problems/spiral-matrix-iii/ 1. 2022.03.31 시도 소요시간: 21분 class Solution { private String[] d = new String[]{"RIGHT", "DOWN", "LEFT", "UP"}; public int[][] spiralMatrixIII(int rows, int cols, int rStart, int cStart) { int rowSize = 1; int colSize = 1; int p=rStart; int q=cStart; int[][] ret = new int[rows*cols][2]; int directionIndex = 0; int counter = 0; ret[counter++] = new i..

https://leetcode.com/problems/spiral-matrix-ii/ 1. 2022.03.31 시도 소요시간: 5분 class Solution { private String[] d = new String[]{"RIGHT", "DOWN", "LEFT", "UP"}; public int[][] generateMatrix(int n) { int rowSize = n; int colSize = n; int p = 0; int q = -1; int[][] matrix = new int[n][n]; int directionIndex = 0; int number = 1; while( rowSize != 0 || colSize != 0) { String direction = d[directionInde..