Majority Element

Majority Element

Given an array nums of size n, return the majority element.

The majority element is the element that appears more than Math.floor(n / 2) times. You may assume that the majority element always exists in the array.

Examples

Example 1:

Input: nums = [3, 2, 3]
Output: 3
Explanation: 3 appears 2 times out of 3 elements (2 > 3/2).

Example 2:

Input: nums = [2, 2, 1, 1, 1, 2, 2]
Output: 2
Explanation: 2 appears 4 times out of 7 elements (4 > 7/2).

Example 3:

Input: nums = [1]
Output: 1

Constraints

• 1 <= nums.length <= 5 * 10^4
• -10^9 <= nums[i] <= 10^9
• The majority element is guaranteed to exist.

Expected Complexity

• Time: O(n)
• Space: O(1)