Solution (leetcode-in-java 1.19 API)

java.lang.Object
- g0201_0300.s0229_majority_element_ii.Solution

```
public class Solution
extends Object
```
229 - Majority Element II.
Medium

Given an integer array of size n, find all elements that appear more than \u230a n/3 \u230b 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]

Constraints:
- 1 <= nums.length <= 5 * 10⁴
- -10⁹ <= nums[i] <= 10⁹
Follow up: Could you solve the problem in linear time and in O(1) space?

- Constructor Summary
  
  Constructors
  Constructor Description
  
  Solution()
- Method Summary
  
  All Methods Instance Methods Concrete Methods
  Modifier and Type Method Description
  
  List<Integer> majorityElement(int[] nums)
  - Methods inherited from class java.lang.Object
    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail
- Solution
```
public Solution()
```

Method Detail

majorityElement

public List<Integer> majorityElement(int[] nums)