Majority Element

Try to solve the Majority Element problem.

Statement

Given an array, nums, having nn integers, return the majority element. An element will be considered a majority element if it occurs more than ⌊n/2⌋⌊n / 2⌋ times in the array.

Note: It is safe to assume that the majority element always exists in the array.

Constraints

  • n==n == nums.length
  • 1≤n≤3∗1031\leq n\leq 3 * 10^3
  • −104≤−10^4 \leq nums[i] ≤104\leq10^4

Examples