problem229

README

< Previous 　　　　　　　　　　　　　　　　 Next >

229. Majority Element II (Medium)

Given an integer array of size n, find all elements that appear more than ⌊ n/3 ⌋ times.

Follow-up: Could you solve the problem in linear time and in O(1) space?

 

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 * 104
• -109 <= nums[i] <= 109

Related Topics

[Array] [Hash Table] [Counting] [Sorting]

Similar Questions

1. Majority Element (Easy)
2. Check If a Number Is Majority Element in a Sorted Array (Easy)

Hints

Hint 1

How many majority elements could it possibly have?
Do you have a better hint? Suggest it!