| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 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 |
Tags
- data science
- attribute
- Python Code
- 밴픽
- concurrency
- 프로그래머스
- Decorator
- Substring with Concatenation of All Words
- LeetCode
- DWG
- Class
- Regular Expression
- 43. Multiply Strings
- Python Implementation
- 파이썬
- 715. Range Module
- Convert Sorted List to Binary Search Tree
- Python
- 315. Count of Smaller Numbers After Self
- t1
- 30. Substring with Concatenation of All Words
- 109. Convert Sorted List to Binary Search Tree
- kaggle
- iterator
- Generator
- Protocol
- shiba
- 컴퓨터의 구조
- 시바견
- 운영체제
Archives
- Today
- Total
목록Course Schedule (1)
Scribbling
LeetCode: 207. Course Schedule
위상정렬을 이용한다. class Solution: def canFinish(self, numCourses: int, prerequisites: List[List[int]]) -> bool: indegrees = [0] * numCourses graph = [[] for _ in range(numCourses)] for v, u in prerequisites: graph[u].append(v) indegrees[v] += 1 q = [] for node, indegree in enumerate(indegrees): if indegree == 0: q.append(node) while q: u = q.pop() for v in graph[u]: indegrees[v] -= 1 if indegrees[v] =..
Computer Science/Coding Test
2021. 8. 14. 19:55