#229

Majority Element II

specialist · 775 · lc medium +31 · verified · 55.9% accepted · 10,944 likes · top 49%

Description

Given an integer array of size n, find every element that appears strictly more than &lfloor; n/3 &rfloor; times and return them.

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]

Code

1

2

3

class Solution:
    def majorityElement(self, nums: List[int]) -> List[int]:

class Solution:
    def majorityElement(self, nums: List[int]) -> List[int]: