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 540 with 15 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 540 # by problem number
lcpy gen -s single_element_in_a_sorted_array # by problem name
O(log n) time and O(1) space.
Input: nums = [1,1,2,3,3,4,4,8,8]
Output: 2
Input: nums = [3,3,7,7,10,11,11]
Output: 10
1 <= nums.length <= 10^50 <= nums[i] <= 10^5class Solution:
# Time: O(log n)
# Space: O(1)
def single_non_duplicate(self, nums: list[int]) -> int:
lo, hi = 0, len(nums) - 1
while lo < hi:
mid = (lo + hi) // 2
if mid % 2 == 1:
mid -= 1
if nums[mid] == nums[mid + 1]:
lo = mid + 2
else:
hi = mid
return nums[lo]
| Time | Space |
|---|---|
| O(log n) | O(1) |