Funcia
Lv.1arraycountinghash

Majority Element

Memory limit
256 MB
Correctness time limit
10000 ms
Solvers
0
0

Given an integer array nums in which exactly one value appears more than half of the time, return that majority value.

Examples

numsresult
[3, 2, 3]3
[2, 2, 1, 1, 1, 2, 2]2
[-7]-7

Efficiency

This problem has performance tests. Judge the required time complexity from the input sizes in the constraints.

Function signature

solution(nums: int[]) → int

Constraints

  • 1≤1 \le nums.length ≤200,000\le 200{,}000
  • −109≤-10^9 \le nums[i] ≤109\le 10^9
  • A majority element (more than ⌊N/2⌋\lfloor N/2 \rfloor occurrences) always exists.

Expected complexity

Time
O(N)
Space
O(1)

Examples

numsExpected
[3,2,3]3
[2,2,1,1,1,2,2]2
[-7]-7

Hint

Hint

Counting with a hash map is O(N)O(N). For O(1)O(1) extra space use the Boyer–Moore vote: keep a candidate and a counter, adopt the current value when the counter is 0, add one on a match and subtract one otherwise. Recounting the whole array for every element is O(N2)O(N^2) and exceeds the time limit.

Time limits per language

LanguageEfficiency time limit
C (GCC, gnu17)200 msestimated
C++ (GCC, gnu++23)200 msderived
Python 3.131000 msderived
Java 251058 msderived
Kotlin 2.4 (JVM)1400 msestimated
C# 14 (.NET 10)1400 msestimated

Test groups

GroupWeightTestsVisibility
sample03inputs and outputs
correctness4010verdict only
performance604verdict only
Loading editor…
Log in to run or submit code.

No result yet. Run or submit your code.