mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 19:53:12 +08:00
25 lines
657 B
HTML
25 lines
657 B
HTML
<p>A majority element is an element that makes up more than half of the items in an array. Given a 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> </p>
|
|
|
|
|
|
|
|
<p><strong>Example 2: </strong></p>
|
|
|
|
|
|
|
|
<pre>
|
|
|
|
<strong>Input: </strong>[3,2]
|
|
|
|
<strong>Output: </strong>-1</pre>
|
|
|
|
|
|
|
|
<p> </p>
|
|
|
|
|
|
|
|
<p><strong>Example 3: </strong></p>
|
|
|
|
|
|
|
|
<pre>
|
|
|
|
<strong>Input: </strong>[2,2,1,1,1,2,2]
|
|
|
|
<strong>Output: </strong>2
|
|
|
|
</pre>
|
|
|