mirror of
https://github.com/halfrost/LeetCode-Go.git
synced 2025-07-05 08:27:30 +08:00
29 lines
982 B
Markdown
Executable File
29 lines
982 B
Markdown
Executable File
# [169. Majority Element](https://leetcode.com/problems/majority-element/)
|
||
|
||
|
||
## 题目
|
||
|
||
Given an array of size n, find the majority element. The majority element is the element that appears **more than** `⌊ n/2 ⌋` times.
|
||
|
||
You may assume that the array is non-empty and the majority element always exist in the array.
|
||
|
||
**Example 1:**
|
||
|
||
Input: [3,2,3]
|
||
Output: 3
|
||
|
||
**Example 2:**
|
||
|
||
Input: [2,2,1,1,1,2,2]
|
||
Output: 2
|
||
|
||
## 题目大意
|
||
|
||
|
||
给定一个大小为 n 的数组，找到其中的众数。众数是指在数组中出现次数大于 ⌊ n/2 ⌋ 的元素。你可以假设数组是非空的，并且给定的数组总是存在众数。
|
||
|
||
|
||
## 解题思路
|
||
|
||
- 题目要求找出数组中出现次数大于 `⌊ n/2 ⌋` 次的数。要求空间复杂度为 O(1)。简单题。
|
||
- 这一题利用的算法是 Boyer-Moore Majority Vote Algorithm。[https://www.zhihu.com/question/49973163/answer/235921864](https://www.zhihu.com/question/49973163/answer/235921864) |