Notice
Recent Posts
Recent Comments
Link
| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 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
- hash table
- dfs
- 이진트리
- HashTable
- Depth-first Search
- matrix
- linked list
- sorting
- leetcode
- two pointers
- tree
- 중간
- 재귀
- 쉬움
- math
- easy
- binary search
- Medium
- DP
- list
- string
- Binary
- 문자열
- 미디움
- recursive
- backtracking
- binary tree
- Python
- 리트코드
- Array
Archives
- Today
- Total
목록leetcode 108 (1)
부부의 코딩 성장 일기
LeetCode 108(Convert Sorted Array to Binary Search Tree, Python)
1. 문제 링크 Convert Sorted Array to Binary Search Tree - LeetCode Convert Sorted Array to Binary Search Tree - LeetCode Can you solve this real interview question? Convert Sorted Array to Binary Search Tree - Given an integer array nums where the elements are sorted in ascending order, convert it to a height-balanced binary search tree. Example 1: [https://assets.leetcod leetcode.com 2. 문제 설명 오름차순으..
Algorithm/LeetCode
2023. 11. 18. 19:00