| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 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 |
- 프로그래머스
- iterator
- 운영체제
- shiba
- Generator
- 315. Count of Smaller Numbers After Self
- Regular Expression
- t1
- concurrency
- data science
- DWG
- 파이썬
- Python Implementation
- Python Code
- 43. Multiply Strings
- 컴퓨터의 구조
- 시바견
- Class
- 30. Substring with Concatenation of All Words
- Protocol
- Decorator
- kaggle
- Convert Sorted List to Binary Search Tree
- 밴픽
- attribute
- 109. Convert Sorted List to Binary Search Tree
- LeetCode
- Substring with Concatenation of All Words
- Python
- 715. Range Module
- Today
- Total
목록Convert Sorted List to Binary Search Tree (2)
Scribbling
O(N) Time complexity, O(1) Memory Solution using Recursion # Definition for singly-linked list. # class ListNode: # def __init__(self, val=0, next=None): # self.val = val # self.next = next # Definition for a binary tree node. # class TreeNode: # def __init__(self, val=0, left=None, right=None): # self.val = val # self.left = left # self.right = right class Solution: def sortedListToBST(self, he..
# Definition for singly-linked list. # class ListNode: # def __init__(self, val=0, next=None): # self.val = val # self.next = next # Definition for a binary tree node. # class TreeNode: # def __init__(self, val=0, left=None, right=None): # self.val = val # self.left = left # self.right = right class Solution: def sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]: if not head:..