| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 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
- Generator
- DWG
- 밴픽
- 시바견
- LeetCode
- 운영체제
- Convert Sorted List to Binary Search Tree
- Substring with Concatenation of All Words
- attribute
- 컴퓨터의 구조
- t1
- Python Code
- concurrency
- Python Implementation
- shiba
- data science
- 109. Convert Sorted List to Binary Search Tree
- Protocol
- Regular Expression
- Class
- iterator
- 파이썬
- 715. Range Module
- 30. Substring with Concatenation of All Words
- Decorator
- 43. Multiply Strings
- 프로그래머스
- Python
- kaggle
- 315. Count of Smaller Numbers After Self
Archives
- Today
- Total
목록990. Satisfiability of Equality Equations (1)
Scribbling
LeetCode: 990. Satisfiability of Equality Equations
class Solution: def equationsPossible(self, equations: List[str]) -> bool: # Define parents list for find/union parent operations parents = [i for i in range(26)] # find parent operation def find_parent(node): if node == parents[node]: return node parents[node] = find_parent(parents[node]) return parents[node] # union parent operation def union_parent(node1, node2): node1 = find_parent(node1) no..
Computer Science/Coding Test
2022. 2. 26. 20:05