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.
checklist Constraints
n == nums.length 1 <= n <= 5 * 10^4 -10^9 <= nums[i] <= 10^9