|
| 1 | +<h2><a href="https://leetcode.com/problems/majority-element/">169. Majority Element</a></h2><h3>Easy</h3><hr><div><p>Given an array <code>nums</code> of size <code>n</code>, return <em>the majority element</em>.</p> |
| 2 | + |
| 3 | +<p>The majority element is the element that appears more than <code>⌊n / 2⌋</code> times. You may assume that the majority element always exists in the array.</p> |
| 4 | + |
| 5 | +<p> </p> |
| 6 | +<p><strong>Example 1:</strong></p> |
| 7 | +<pre><strong>Input:</strong> nums = [3,2,3] |
| 8 | +<strong>Output:</strong> 3 |
| 9 | +</pre><p><strong>Example 2:</strong></p> |
| 10 | +<pre><strong>Input:</strong> nums = [2,2,1,1,1,2,2] |
| 11 | +<strong>Output:</strong> 2 |
| 12 | +</pre> |
| 13 | +<p> </p> |
| 14 | +<p><strong>Constraints:</strong></p> |
| 15 | + |
| 16 | +<ul> |
| 17 | + <li><code>n == nums.length</code></li> |
| 18 | + <li><code>1 <= n <= 5 * 10<sup>4</sup></code></li> |
| 19 | + <li><code>-10<sup>9</sup> <= nums[i] <= 10<sup>9</sup></code></li> |
| 20 | +</ul> |
| 21 | + |
| 22 | +<p> </p> |
| 23 | +<strong>Follow-up:</strong> Could you solve the problem in linear time and in <code>O(1)</code> space?</div> |
0 commit comments