class Solution:
def search(self, nums: List[int], target: int) -> int:
def bst(l, r):
while l<=r:
mid = (l+r)//2
if nums[mid] < target:
l = mid+1
elif nums[mid] > target:
r =mid -1
else:
return mid
return -1
return bst(0, len(nums)-1)
https://youtu.be/s4DPM8ct1pI?si=E2bD8-D_rcUUtBXz
'LeetCode > 주제별 보충' 카테고리의 다른 글
| BST: 981. Time Based Key-Value Store ★★★ (0) | 2025.01.21 |
|---|---|
| BST: 278. First Bad Version (0) | 2025.01.21 |
| Hashmap: 217. Contains Duplicate (0) | 2025.01.20 |
| Heap-PrioiryQueue: 621. Task Scheduler ★★★ (0) | 2025.01.20 |
| Heap-PrioiryQueue: 215. Kth Largest Element in an Array ★ (0) | 2025.01.20 |