Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 704 with 13 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 704 # by problem number
lcpy gen -s binary_search # by problem name
nums which is sorted in ascending order, and an integer target, write a function to search target in nums. If target exists, then return its index. Otherwise, return -1.
You must write an algorithm with O(log n) runtime complexity.
Input: nums = [-1,0,3,5,9,12], target = 9
Output: 4
Input: nums = [-1,0,3,5,9,12], target = 2
Output: -1
1 <= nums.length <= 10^4-10^4 < nums[i], target < 10^4nums are unique.nums is sorted in ascending order.class Solution:
# Time: O(log n)
# Space: O(1)
def search(self, nums: list[int], target: int) -> int:
left, right = 0, len(nums) - 1
while left <= right:
mid = (left + right) // 2
if nums[mid] == target:
return mid
elif nums[mid] < target:
left = mid + 1
else:
right = mid - 1
return -1
| Time | Space |
|---|---|
| O(log n) | O(1) |