Majority Element

Easy

Given an array nums of size n, return the majority element (the one appearing more than n/2 times). It always exists.

Example 1

Input:  nums = [3,2,3]
Output: 3

Example 2

Input:  nums = [2,2,1,1,1,2,2]
Output: 2

Constraints

• n == nums.length
• 1 <= n <= 5*10^4
• The majority element always exists.