Description
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.
Examples
Input:
nums = [3,2,3]Output:
3Explanation:
3 appears twice, which is more than 3/2 = 1.5 times.
Input:
nums = [2,2,1,1,1,2,2]Output:
2Explanation:
2 appears 4 times, which is more than 7/2 = 3.5 times.
Input:
nums = [-1, -1, -1, 2, 2]Output:
-1Explanation:
-1 appears 3 times, which is more than 5/2 = 2.5 times, making it the majority element.
Constraints
- •
n == nums.length - •
1 ≤ n ≤ 5 × 10⁴ - •
-10⁹ ≤ nums[i] ≤ 10⁹