#229
Majority Element II
medium · verified · 55.9% accepted · 10,944 likes · top 49%
array · hash table · sorting · counting
Description
Given an integer array of size n, find all elements that appear more than ⌊ n/3 ⌋ times.
Example 1:
Input: nums = [3,2,3]
Output: [3]
Example 2:
Input: nums = [1]
Output: [1]
Example 3:
Input: nums = [1,2]
Output: [1,2]
Solution