D36CHOI

문제 https://leetcode.com/problems/top-k-frequent-elements/ Top K Frequent Elements - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 내 풀이 class Solution { public class Element { public int number; public int counter; Element(int number, int counter) { this.number = number; this.coun..

문제 https://leetcode.com/problems/search-a-2d-matrix/submissions/ Search a 2D Matrix - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 내 풀이 class Solution { public boolean searchMatrix(int[][] matrix, int target) { int row = matrix.length-1; for(int i=0; i

문제 https://leetcode.com/problems/search-in-rotated-sorted-array-ii/ Search in Rotated Sorted Array II - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 내 풀이 from collections import deque class Solution: def search(self, nums: List[int], target: int) -> bool: nums = deque(set(nums))..

문제 https://leetcode.com/problems/two-city-scheduling/ Two City Scheduling - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 내 풀이 class Solution: def twoCitySchedCost(self, costs: List[List[int]]) -> int: answer = 0 costs = sorted(costs, key = lambda x : -abs(x[0] - x[1])) n = len(c..

문제 https://leetcode.com/problems/smallest-string-with-a-given-numeric-value/ Smallest String With A Given Numeric Value - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 내 풀이 class Solution { public String getSmallestString(int n, int k) { int remain = k - n; char[] array = new cha..

문제 https://leetcode.com/problems/minimum-domino-rotations-for-equal-row/ Minimum Domino Rotations For Equal Row - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 내 풀이 import java.util.Arrays; class Solution { public int minDominoRotations(int[] tops, int[] bottoms) { int[] rotation..

문제 https://leetcode.com/problems/maximum-frequency-stack/submissions/ Maximum Frequency Stack - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 내 풀이 import java.util.*; public class FreqStack { public class Data { public int number; public int nowCount; public int latest; public Da..