목록python Leetcode (53)

소프트웨어에 대한 모든 것

LeetCode 풀기 - 1026. Maximum Difference Between Node and Ancestor

1026. Maximum Difference Between Node and Ancestor https://leetcode.com/problems/maximum-difference-between-node-and-ancestor/ Maximum Difference Between Node and Ancestor - 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) Recursive Consistency is a key!!! 2021년 마지막 문제 풀이입..
알고리즘/LeetCode 2021. 12. 31. 20:48
LeetCode 풀기 - 1356. Sort Integers by The Number of 1 Bits

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 = ..
알고리즘/LeetCode 2021. 12. 29. 20:18
LeetCode 풀기 - 1380. Lucky Numbers in a Matrix

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 = ..
알고리즘/LeetCode 2021. 12. 29. 20:01
540. Single Element in a Sorted Array

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를 저장하고, 두 번째 등..
알고리즘/LeetCode 2021. 12. 28. 06:23
LeetCode 풀기 - 476. Number Complement

476. Number Complement https://leetcode.com/problems/number-complement/ Number Complement - 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 findComplement(self, num: int) -> int: res = [] for c in bin(num)[2:]: if c == '1': res.append('0') else: res.ap..
카테고리 없음 2021. 12. 27. 21:12
LeetCode 풀기 - 973. K Closest Points to Origin

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..
알고리즘/LeetCode 2021. 12. 26. 13:52
LeetCode 풀기 - 56. Merge Intervals

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..
알고리즘/LeetCode 2021. 12. 24. 16:22
LeetCode 풀기 - 1200. Minimum Absolute Difference

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] :..
알고리즘/LeetCode 2021. 12. 21. 08:01
Prev 1 2 3 4 5 6 7 Next