algorithm/LeetCode-Go
1
0
Fork 0
mirror of https://github.com/halfrost/LeetCode-Go.git synced 2026-03-13 10:02:05 +08:00
Code Issues Packages Projects Releases Wiki Activity

更新 problem 229

Browse Source
This commit is contained in:
YDZ
2019-07-14 18:05:34 +08:00
parent 002b8e25e9
commit f360d4e3fc
1 changed files with 2 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
Algorithms/0229. Majority Element II/README.md
View File

@@ -24,5 +24,6 @@ Given an integer array of size n, find all elements that appear more than `⌊
## 解题思路
- 这一题是第 169 题的加强版。
- 这一题是第 169 题的加强版。Boyer-Moore Majority Vote algorithm 算法的扩展版。
- 题目要求找出数组中出现次数大于 `⌊ n/3 ⌋` 次的数。要求空间复杂度为 O(1)。简单题。
- 这篇文章写的不错，可参考：[https://gregable.com/2013/10/majority-vote-algorithm-find-majority.html](https://gregable.com/2013/10/majority-vote-algorithm-find-majority.html)