Majority Element II
Medium
Topics
Given an integer array nums of size n, return all elements that appear more than ⌊n/3⌋ times, sorted in ascending order.
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]
Constraints
- 1 <= nums.length <= 5*10^4
- -10^9 <= nums[i] <= 10^9
Run ⌘' · Submit ⌘⏎
SensAI