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 169 with 15 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 169 # by problem number
lcpy gen -s majority_element # by problem name
nums of size n, return the majority element.
The majority element is the element that appears more than ⌊n / 2⌋ times. You may assume that the majority element always exists in the array.
Input: nums = [3,2,3]
Output: 3
Input: nums = [2,2,1,1,1,2,2]
Output: 2
class Solution:
# Time: O(n)
# Space: O(1)
# Boyer-Moore Voting Algorithm
def majority_element(self, nums: list[int]) -> int:
candidate = 0
count = 0
for num in nums:
if count == 0:
candidate = num
count += 1 if num == candidate else -1
return candidate
| Time | Space |
|---|---|
| O(n) | O(1) |