From f360d4e3fcda34a5d26053ef8697ca4b20ed4644 Mon Sep 17 00:00:00 2001 From: YDZ Date: Sun, 14 Jul 2019 18:05:34 +0800 Subject: [PATCH] =?UTF-8?q?=E6=9B=B4=E6=96=B0=20problem=20229?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- Algorithms/0229. Majority Element II/README.md | 3 ++- 1 file changed, 2 insertions(+), 1 deletion(-) diff --git a/Algorithms/0229. Majority Element II/README.md b/Algorithms/0229. Majority Element II/README.md index e490b83e..e01c44e2 100755 --- a/Algorithms/0229. Majority Element II/README.md +++ b/Algorithms/0229. Majority Element II/README.md @@ -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) \ No newline at end of file