Project Notes

Majority Element II

3 min read

Nav: << previous: 228.汇总区间 | next: 230.二叉搜索树中第 K 小的元素 >>

Description

tab: English
 
<p>Given an integer array of size <code>n</code>, find all elements that appear more than <code>&lfloor; n/3 &rfloor;</code> times.</p>
 
<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
 
<pre>
<strong>Input:</strong> nums = [3,2,3]
<strong>Output:</strong> [3]
</pre>
 
<p><strong class="example">Example 2:</strong></p>
 
<pre>
<strong>Input:</strong> nums = [1]
<strong>Output:</strong> [1]
</pre>
 
<p><strong class="example">Example 3:</strong></p>
 
<pre>
<strong>Input:</strong> nums = [1,2]
<strong>Output:</strong> [1,2]
</pre>
 
<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>
 
<ul>
	<li><code>1 &lt;= nums.length &lt;= 5 * 10<sup>4</sup></code></li>
	<li><code>-10<sup>9</sup> &lt;= nums[i] &lt;= 10<sup>9</sup></code></li>
</ul>
 
<p>&nbsp;</p>
<p><strong>Follow up:</strong> Could you solve the problem in linear time and in <code>O(1)</code> space?</p>
 
 
 
> [!tip]- Hint 1
> 
> Think about the possible number of elements that can appear more than ⌊ n/3 ⌋ times in the array.
 
> [!tip]- Hint 2
> 
> It can be at most two. Why?
 
> [!tip]- Hint 3
> 
> Consider using Boyer-Moore Voting Algorithm, which is efficient for finding elements that appear more than a certain threshold.
 
 
---
 
[submissions](https://leetcode.com/problems/majority-element-ii/submissions/) | [solutions](https://leetcode.com/problems/majority-element-ii/solutions/)
 
 
tab: 中文
 
<p>给定一个大小为&nbsp;<em>n&nbsp;</em>的整数数组，找出其中所有出现超过&nbsp;<code>⌊ n/3 ⌋</code>&nbsp;次的元素。</p>
 
<p>&nbsp;</p>
 
<p><strong>示例&nbsp;1：</strong></p>
 
<pre>
<strong>输入：</strong>nums = [3,2,3]
<strong>输出：</strong>[3]</pre>
 
<p><strong>示例 2：</strong></p>
 
<pre>
<strong>输入：</strong>nums = [1]
<strong>输出：</strong>[1]
</pre>
 
<p><strong>示例 3：</strong></p>
 
<pre>
<strong>输入：</strong>nums = [1,2]
<strong>输出：</strong>[1,2]</pre>
 
<p>&nbsp;</p>
 
<p><strong>提示：</strong></p>
 
<ul>
	<li><code>1 &lt;= nums.length &lt;= 5 * 10<sup>4</sup></code></li>
	<li><code>-10<sup>9</sup> &lt;= nums[i] &lt;= 10<sup>9</sup></code></li>
</ul>
 
<p>&nbsp;</p>
 
<p><strong>进阶：</strong>尝试设计时间复杂度为 O(n)、空间复杂度为 O(1)的算法解决此问题。</p>
 
 
 
> [!tip]- 提示 1
> 
> Think about the possible number of elements that can appear more than ⌊ n/3 ⌋ times in the array.
 
> [!tip]- 提示 2
> 
> It can be at most two. Why?
 
> [!tip]- 提示 3
> 
> Consider using Boyer-Moore Voting Algorithm, which is efficient for finding elements that appear more than a certain threshold.
 
 
---
 
[提交记录](https://leetcode.cn/problems/majority-element-ii/submissions/) | [题解](https://leetcode.cn/problems/majority-element-ii/solution/)

Solutions & Notes

properties:
  note.updated:
    displayName: Last Updated
  note.relative_links:
    displayName: Related Links
  note.desc:
    displayName: Description
  note.grade:
    displayName: Rating
  note.program_language:
    displayName: Language
  note.time_complexity:
    displayName: TC
  note.space_complexity:
    displayName: SC
views:
  - type: table
    name: Solutions & Notes
    filters:
      and:
        - file.hasLink(this.file)
        - file.tags.containsAny("leetcode/solution", "leetcode/note")
    order:
      - file.name
      - desc
      - program_language
      - time_complexity
      - space_complexity
      - grade
      - relative_links
      - updated
    sort:
      - property: grade
        direction: ASC
      - property: time_complexity
        direction: ASC
      - property: program_language
        direction: ASC
    columnSize:
      file.name: 104
      note.space_complexity: 65
      note.grade: 126

Similar Problems

properties:
  note.lcTopics:
    displayName: Topics
  note.lcAcRate:
    displayName: AC Rate
  note.favorites:
    displayName: Favorites
  note.grade:
    displayName: Rating
  note.translatedTitle:
    displayName: Title (CN)
  note.lcDifficulty:
    displayName: Difficulty
views:
  - type: table
    name: Similar Problems
    filters:
      and:
        - file.hasLink(this.file)
        - similarQuestions.contains(this.file)
    order:
      - file.name
      - translatedTitle
      - lcTopics
      - lcDifficulty
      - lcAcRate
      - grade
      - favorites
    sort:
      - property: file.name
        direction: ASC
      - property: lcTopics
        direction: DESC
    columnSize:
      note.translatedTitle: 240
      note.lcTopics: 347
      note.lcAcRate: 75
      note.grade: 122

Graph View

Backlinks