mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-10-05 21:29:29 +00:00
bc8df6de31
* [pre-commit.ci] pre-commit autoupdate updates: - [github.com/astral-sh/ruff-pre-commit: v0.2.2 → v0.3.2](https://github.com/astral-sh/ruff-pre-commit/compare/v0.2.2...v0.3.2) - [github.com/pre-commit/mirrors-mypy: v1.8.0 → v1.9.0](https://github.com/pre-commit/mirrors-mypy/compare/v1.8.0...v1.9.0) * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci --------- Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>
39 lines
1.2 KiB
Python
39 lines
1.2 KiB
Python
"""
|
|
This is Booyer-Moore Majority Vote Algorithm. The problem statement goes like this:
|
|
Given an integer array of size n, find all elements that appear more than ⌊ n/k ⌋ times.
|
|
We have to solve in O(n) time and O(1) Space.
|
|
URL : https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore_majority_vote_algorithm
|
|
"""
|
|
|
|
from collections import Counter
|
|
|
|
|
|
def majority_vote(votes: list[int], votes_needed_to_win: int) -> list[int]:
|
|
"""
|
|
>>> majority_vote([1, 2, 2, 3, 1, 3, 2], 3)
|
|
[2]
|
|
>>> majority_vote([1, 2, 2, 3, 1, 3, 2], 2)
|
|
[]
|
|
>>> majority_vote([1, 2, 2, 3, 1, 3, 2], 4)
|
|
[1, 2, 3]
|
|
"""
|
|
majority_candidate_counter: Counter[int] = Counter()
|
|
for vote in votes:
|
|
majority_candidate_counter[vote] += 1
|
|
if len(majority_candidate_counter) == votes_needed_to_win:
|
|
majority_candidate_counter -= Counter(set(majority_candidate_counter))
|
|
majority_candidate_counter = Counter(
|
|
vote for vote in votes if vote in majority_candidate_counter
|
|
)
|
|
return [
|
|
vote
|
|
for vote in majority_candidate_counter
|
|
if majority_candidate_counter[vote] > len(votes) / votes_needed_to_win
|
|
]
|
|
|
|
|
|
if __name__ == "__main__":
|
|
import doctest
|
|
|
|
doctest.testmod()
|