Loading problem…
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.
Example 1
Input: nums = [2,2,1,1,1,2,2]
Output: 2
Explanation: 2 appears 4 times in an array of 7, which is more than 7 / 2 = 3.5, so 2 is the majority element.
Example 2
Input: nums = [3,2,3]
Output: 3
Explanation: 3 appears 2 times out of 3, which is more than half.
Example 3
Input: nums = [1]
Output: 1
Explanation: The only element is trivially the majority.
Keep a single candidate and a count. Matching votes raise the count, differing votes lower it; when it hits zero, adopt the current element as the new candidate. The true majority survives because it outnumbers everything else combined.
Run checks all cases above. Submit evaluates all test cases.