소프트웨어에 대한 모든 것

1356. Sort Integers by The Number of 1 Bits https://leetcode.com/problems/sort-integers-by-the-number-of-1-bits/ Sort Integers by The Number of 1 Bits - 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 문제) 솔루션1) class Solution: def sortByBits(self, arr: List[int]) -> List[int]: d = ..

1380. Lucky Numbers in a Matrix https://leetcode.com/problems/lucky-numbers-in-a-matrix/ Lucky Numbers in a 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 문제) 솔루션1) class Solution: def luckyNumbers (self, matrix: List[List[int]]) -> List[int]: n_row = len(matrix) n_col = ..

227. Basic Calculator II https://leetcode.com/problems/basic-calculator-ii/ Basic Calculator 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 문제) 솔루션1) 스택 class Solution: def calculate(self, s: str) -> int: def update(op, num): if op == '+': stack.append(num) if op == '-': stac..

540. Single Element in a Sorted Array https://leetcode.com/problems/single-element-in-a-sorted-array/ Single Element in a Sorted Array - 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 문제) 솔루션1) - hash 사용 단 하나의 elemnt를 제외하고 모든 원소들은 두 번 등장합니다. hash 자료구조에 처음 나오는 element를 저장하고, 두 번째 등..

973. K Closest Points to Origin https://leetcode.com/problems/k-closest-points-to-origin/ K Closest Points to Origin - 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 문제) 솔루션1) class Solution: def kClosest(self, points: List[List[int]], k: int) -> List[List[int]]: distances = [] fo..

56. Merge Intervals https://leetcode.com/problems/merge-intervals/ Merge Intervals - 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 문제) 솔루션1) straight forward class Solution: def merge(self, intervals: List[List[int]]) -> List[List[int]]: intervals = sorted(intervals, key=lambda x..

143. Reorder List https://leetcode.com/problems/reorder-list/ Reorder List - 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 문제) 솔루션1) two deques 두 개의 deque() 자료구조를 사용합니다. 풀이 전략: deque() 자료구조 q1, q2를 준비 리스트 전체를 순회해서 모든 값을 q1에 넣음 q1 아이템에서 뒤의 절반에 해당되는 부분을 pop()해서 q2에 추가 q1, q2 아이템을 번..

1200. Minimum Absolute Difference https://leetcode.com/problems/minimum-absolute-difference/ Minimum Absolute Difference - 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 문제) 솔루션1) Easy one path class Solution(object): def minimumAbsDifference(self, arr): """ :type arr: List[int] :..