majority-element-ii

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given an integer array of size <code>n</code>, find all elements that appear more than <code>&lfloor; n/3 &rfloor;</code> times.

&nbsp;
Example 1:

<pre>
Input: nums = [3,2,3]
Output: [3]
</pre>

Example 2:

<pre>
Input: nums = [1]
Output: [1]
</pre>

Example 3:

<pre>
Input: nums = [1,2]
Output: [1,2]
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= nums.length &lt;= 5 * 104</code></li>
	<li><code>-109 &lt;= nums[i] &lt;= 109</code></li>
</ul>

&nbsp;
Follow up: Could you solve the problem in linear time and in <code>O(1)</code> space?

majorityElement

Majority Element II

Majority Element

majority-element

多数元素

Check If a Number Is Majority Element in a Sorted Array

check-if-a-number-is-majority-element-in-a-sorted-array

检查一个数是否在数组中占绝大多数

Most Frequent Even Element

most-frequent-even-element

出现最频繁的偶数元素

Array

Hash Table

Counting

Sorting

给定一个大小为&nbsp;n&nbsp;的整数数组，找出其中所有出现超过&nbsp;<code>⌊ n/3 ⌋</code>&nbsp;次的元素。

&nbsp;

示例&nbsp;1：

<pre>
输入：nums = [3,2,3]
输出：[3]</pre>

示例 2：

<pre>
输入：nums = [1]
输出：[1]
</pre>

示例 3：

<pre>
输入：nums = [1,2]
输出：[1,2]</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= nums.length &lt;= 5 * 104</code></li>
	<li><code>-109 &lt;= nums[i] &lt;= 109</code></li>
</ul>

&nbsp;

进阶：尝试设计时间复杂度为 O(n)、空间复杂度为 O(1)的算法解决此问题。