coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-18 11:36:48 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

更新国内版力扣题目描述变更

Browse Source
This commit is contained in:
小墨
2022-05-02 23:42:43 +08:00
parent 74598d1cf8
commit 7ea03594b3
198 changed files with 11378 additions and 11118 deletions
Download Patch File Download Diff File Expand all files Collapse all files

48
leetcode-cn/problem (English)/主要元素(English) [find-majority-element-lcci].html
View File

@@ -1,24 +1,24 @@
<p>A majority element is an element that makes up more than half of the items in an array. Given a&nbsp;integers array, find the majority element. If there is no majority element, return -1. Do this in O(N) time and O(1) space.</p>
<p><strong>Example 1: </strong></p>
<pre>
<strong>Input: </strong>[1,2,5,9,5,9,5,5,5]
<strong>Output: </strong>5</pre>
<p>&nbsp;</p>
<p><strong>Example 2: </strong></p>
<pre>
<strong>Input: </strong>[3,2]
<strong>Output: </strong>-1</pre>
<p>&nbsp;</p>
<p><strong>Example 3: </strong></p>
<pre>
<strong>Input: </strong>[2,2,1,1,1,2,2]
<strong>Output: </strong>2
</pre>
<p>A majority element is an element that makes up more than half of the items in an array. Given a&nbsp;integers array, find the majority element. If there is no majority element, return -1. Do this in O(N) time and O(1) space.</p>
<p><strong>Example 1: </strong></p>
<pre>
<strong>Input: </strong>[1,2,5,9,5,9,5,5,5]
<strong>Output: </strong>5</pre>
<p>&nbsp;</p>
<p><strong>Example 2: </strong></p>