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 1150 with 26 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 1150 # by problem number
lcpy gen -s check_if_a_number_is_majority_element_in_a_sorted_array # by problem name
nums sorted in non-decreasing order and an integer target, return true if target is a majority element, or false otherwise.
A majority element in an array nums is an element that appears more than nums.length / 2 times in the array.
Input: nums = [2,4,5,5,5,5,5,6,6], target = 5
Output: true
Input: nums = [10,100,101,101], target = 101
Output: false
1 <= nums.length <= 10001 <= nums[i], target <= 10^9nums is sorted in non-decreasing order.class Solution:
# Time: O(log n)
# Space: O(1)
def is_majority_element(self, nums: list[int], target: int) -> bool:
left = 0
right = len(nums)
while left < right:
mid = (left + right) // 2
if nums[mid] < target:
left = mid + 1
else:
right = mid
candidate = left + len(nums) // 2
return candidate < len(nums) and nums[candidate] == target
| Time | Space |
|---|---|
| O(log n) | O(1) |