Given an integer array of size n, find all elements that appear more than ⌊n/3⌋ times.
n
⌊n/3⌋
1 <= nums.length <= 5 * 10^4
-10^9 <= nums[i] <= 10^9
nums = [3,2,3]
[3]
nums = [1]
[1]
nums = [1,2]
[1,2]