Given an array of integers *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.
nums = [array of integers]
integer (the majority element)
Example 1:
Input:
nums = [3,2,3]
Output:
3
Explanation:
3 appears twice which is more than ⌊3/2⌋ = 1.
Example 2:
Input:
nums = [2,2,1,1,1,2,2]
Output:
2
Explanation:
2 appears 4 times which is more than ⌊7/2⌋ = 3.