일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 |
- python Leetcode
- 파이썬알고리즘
- 릿코드풀기
- leetcode풀이
- 파이썬알고리즘풀기
- 알고리즘풀기
- python 알고리즘
- 파이썬릿코드
- 코틀린기초
- 파이썬 알고리즘
- leetcode 풀기
- 파이썬릿코드풀기
- LeetCode
- python xor
- python zip_longest
- 상가수익률계산기
- 파이썬 릿코드
- 릿코드 파이썬
- 릿코드
- 릿코드풀이
- python 릿코드
- python sorted
- binary search
- 잇츠디모
- leetcode풀기
- 릿코드 풀기
- 알고리즘풀이
- 파이썬 프로그래머스
- 파이썬 알고리즘 풀기
- python priority queue
- Today
- Total
목록알고리즘풀기 (7)
소프트웨어에 대한 모든 것

1551. Minimum Operations to Make Array Equal https://leetcode.com/problems/minimum-operations-to-make-array-equal/ Minimum Operations to Make Array Equal - 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 mid를 구하고 arr의 길이가 짝수인 경우와 홀수인 경우를 나눠서 생각하며 쉽게 풀립니..

278. First Bad Version https://leetcode.com/problems/first-bad-version/ First Bad Version - 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) 바이너리 서치를 방법을 사용한다. # The isBadVersion API is already defined for you. # @param version, an integer # @return an integer # def isBadV..

797. All Paths From Source to Target https://leetcode.com/problems/all-paths-from-source-to-target/ All Paths From Source to Target - 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) DFS 방법을 이용해서 재귀적으로 path를 탐색한다. class Solution: def allPathsSourceTarget(self, graph: List[..

1877. Minimize Maximum Pair Sum in Array https://leetcode.com/problems/minimize-maximum-pair-sum-in-array/ Minimize Maximum Pair Sum in 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) 오름차순 정렬 후 최소, 최대 pair를 계속 구해나가서 max를 구한다. class Solution: def minPairSum(self, n..

1464. Maximum Product of Two Elements in an Array https://leetcode.com/problems/maximum-product-of-two-elements-in-an-array/ Maximum Product of Two Elements in an 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) O(nlogn) class Solution: def maxProduct(self, nums: L..

1844. Replace All Digits with Characters https://leetcode.com/problems/replace-all-digits-with-characters/ Replace All Digits with Characters - 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) ord(), chr()에 대한 이해가 필요 ord() : character을 ascii value로 변환 chr() : integer를 char..

1859. Sorting the Sentence https://leetcode.com/problems/sorting-the-sentence/ Sorting the Sentence - 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) 1. sentence을 space로 split 2. 단어의 수를 세고, 단어 수 사이즈 만큼 array 생성 3. 각 단어를 반복문을 돌면서 단어의 마지막을 indexing해서 word position 획득 4. arr..