Majority Element
Given an array 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.
Majority Element
Given an array 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.
Example 1
Input: nums = [3,2,3] Output: 3
Example 2
Input: nums = [2,2,1,1,1,2,2] Output: 2
Show hint
Use Boyer-Moore Voting Algorithm: maintain a candidate and count. Increment count for candidate, decrement for others. If count is 0, set new candidate.
Sign in to submit, save progress and mark problems as solved. You can still run your code.
Loading editor...
nums =
[3,2,3]
Expected
3