| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 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
- Decorator
- DWG
- t1
- shiba
- iterator
- 밴픽
- kaggle
- LeetCode
- 715. Range Module
- 109. Convert Sorted List to Binary Search Tree
- Class
- 30. Substring with Concatenation of All Words
- Protocol
- Python Implementation
- 315. Count of Smaller Numbers After Self
- 파이썬
- Python Code
- Regular Expression
- 프로그래머스
- data science
- 시바견
- Python
- Substring with Concatenation of All Words
- concurrency
- 43. Multiply Strings
- 컴퓨터의 구조
- 운영체제
- Convert Sorted List to Binary Search Tree
- Generator
- attribute
Archives
- Today
- Total
목록124. Binary Tree Maximum Path Sum (1)
Scribbling
LeetCode: 124. Binary Tree Maximum Path Sum
At each node, we have to do two jobs. First: update the global sum with the path going through node, node's left child, and node's right child Second: either choose node's left child or node's right child to return a partial path than can be connected to current node's parent - here we can't choose both left child and right child because if we choose both of them, that path can't be connected to..
Computer Science/Coding Test
2021. 11. 4. 22:25