• Home
• com.github.javadev
• leetcode-in-java11
• 1.4
• source code
• readme.md

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

g0201_0300.s0229_majority_element_ii.readme.md Maven / Gradle / Ivy

229\. Majority Element II

Medium

Given an integer array of size `n`, find all elements that appear more than `⌊ n/3 ⌋` 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 * 104
*   -109 <= nums[i] <= 109

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