From 002b8e25e9ec1c9bfe42544c5560c8015206667a Mon Sep 17 00:00:00 2001 From: YDZ Date: Sat, 13 Jul 2019 19:34:01 +0800 Subject: [PATCH] =?UTF-8?q?=E6=9B=B4=E6=96=B0=20169=20=E9=A2=98=E8=A7=A3?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- Algorithms/0169. Majority Element/README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/Algorithms/0169. Majority Element/README.md b/Algorithms/0169. Majority Element/README.md index a3e1db60..b2e898ac 100755 --- a/Algorithms/0169. Majority Element/README.md +++ b/Algorithms/0169. Majority Element/README.md @@ -26,4 +26,4 @@ You may assume that the array is non-empty and the majority element always exist ## 解题思路 - 题目要求找出数组中出现次数大于 `⌊ n/2 ⌋` 次的数。要求空间复杂度为 O(1)。简单题。 -- 这一题利用的算法是 Boyer-Moore Majority Vote Algorithm。https://www.zhihu.com/question/49973163/answer/235921864 \ No newline at end of file +- 这一题利用的算法是 Boyer-Moore Majority Vote Algorithm。[https://www.zhihu.com/question/49973163/answer/235921864](https://www.zhihu.com/question/49973163/answer/235921864) \ No newline at end of file