일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 | 29 | 30 | 31 |
- leetcode풀이
- python priority queue
- python sorted
- binary search
- 코틀린기초
- 상가수익률계산기
- 파이썬 알고리즘
- 알고리즘풀이
- 파이썬 릿코드
- python 알고리즘
- 파이썬릿코드풀기
- python Leetcode
- python 릿코드
- python zip_longest
- 릿코드
- 릿코드 파이썬
- 파이썬릿코드
- 잇츠디모
- 파이썬알고리즘풀기
- 파이썬 알고리즘 풀기
- LeetCode
- 알고리즘풀기
- 릿코드풀이
- leetcode풀기
- 릿코드풀기
- 릿코드 풀기
- 파이썬알고리즘
- python xor
- 파이썬 프로그래머스
- leetcode 풀기
- Today
- Total
목록파이썬 릿코드 (15)
소프트웨어에 대한 모든 것
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..
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..
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] :..
1572. Matrix Diagonal Sum https://leetcode.com/problems/matrix-diagonal-sum/ Matrix Diagonal Sum - 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 왼쪽 상단에서 부터 오른쪽 하단으로 탐색하면서 더합니다. 오른쪽 상단에서 부터 왼쪽 하단으로 탐색하면서 더합니다. 만약 매트릭스가 row가 홀수 크기로 되어 있다면 중간에 원소를 두 번 더했..
1351. Count Negative Numbers in a Sorted Matrix https://leetcode.com/problems/count-negative-numbers-in-a-sorted-matrix/ Count Negative Numbers in a Sorted 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) - brute force 이중 for 문을 통해서 0보다 작은 number를 셉니다. 시간 복잡도 : O(..
19. Remove Nth Node From End of List https://leetcode.com/problems/remove-nth-node-from-end-of-list/discuss/?currentPage=1&orderBy=most_votes&query= Remove Nth Node From End of List - LeetCode Discuss 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) 스택 자료구조를 사용한다. 모든 노드를 순회하면서 스택에 ..