Problem Description
Given an array of size
N, find the majority element.
The majority element is the element that appears more than
floor(N/2) times.
You may assume that the array is non-empty and the majority element always exist in the array.
Problem Constraints
1 <= |A| <= 106
1 <= Ai <= 109
Input Format
The first argument is an integer array A.
Output Format
Return the majority element.
Example Input
A = [2, 1, 2]
Example Output
2
Example Explanation
2 occurs 2 times which is greater than 3/2.
NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified.
Still have a question? Checkout Sample Codes for more details.