일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
1 | ||||||
2 | 3 | 4 | 5 | 6 | 7 | 8 |
9 | 10 | 11 | 12 | 13 | 14 | 15 |
16 | 17 | 18 | 19 | 20 | 21 | 22 |
23 | 24 | 25 | 26 | 27 | 28 |
- leetcode풀기
- 릿코드 파이썬
- 파이썬릿코드풀기
- 파이썬 알고리즘 풀기
- 알고리즘풀이
- python xor
- 파이썬알고리즘풀기
- python 릿코드
- 파이썬릿코드
- 파이썬알고리즘
- 파이썬 프로그래머스
- 잇츠디모
- python priority queue
- 파이썬 알고리즘
- 릿코드 풀기
- 파이썬 릿코드
- leetcode 풀기
- 릿코드풀기
- python Leetcode
- binary search
- 릿코드
- 알고리즘풀기
- python sorted
- 코틀린기초
- 릿코드풀이
- python 알고리즘
- python zip_longest
- leetcode풀이
- LeetCode
- 상가수익률계산기
- Today
- Total
목록알고리즘/LeetCode (177)
소프트웨어에 대한 모든 것
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] :..
1325. Delete Leaves With a Given Value https://leetcode.com/problems/delete-leaves-with-a-given-value/ Delete Leaves With a Given 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 문제) 솔루션1) Simple 재귀 이진 트리의 순회, 후위 순회에 대해서 이해하고 있다면 쉽게 풀 수 있는 문제입니다. # Definition for a binary tr..
1829. Maximum XOR for Each Query https://leetcode.com/problems/maximum-xor-for-each-query/ Maximum XOR for Each Query - 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) XOR 교환 법칙, 결합 법칙 XOR의 교환 법칙, 결합 법칙의 특성을 알고 있다면 쉽게 풀 수 있는 문제입니다. class Solution: def getMaximumXor(self, ..
2032. Two Out of Three https://leetcode.com/problems/two-out-of-three/ Two Out of Three - 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 twoOutOfThree(self, nums1: List[int], nums2: List[int], nums3: List[int]) -> List[int]: nums = list(set(nums1)) + ..
1347. Minimum Number of Steps to Make Two Strings Anagram https://leetcode.com/problems/minimum-number-of-steps-to-make-two-strings-anagram/ Minimum Number of Steps to Make Two Strings Anagram - 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) dict 자료구조 사용 class Solution: ..
1079. Letter Tile Possibilities https://leetcode.com/problems/letter-tile-possibilities/ Letter Tile Possibilities - 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 class Solution: def numTilePossibilities(self, tiles): res = set() def recur(tiles, path): if p..