8000 更新 169 题解 · DontFearAlgorithms/LeetCode-Go@002b8e2 · GitHub
[go: up one dir, main page]
Skip to content
8000

Commit 002b8e2

Browse files
halfrosthalfrost
committed
更新 169 题解
1 parent d2d0d93 commit 002b8e2

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

‎Algorithms/0169. Majority Element/README.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -26,4 +26,4 @@ You may assume that the array is non-empty and the majority element always exist
2626
## 解题思路
2727

2828
- 题目要求找出数组中出现次数大于 `⌊ n/2 ⌋` 次的数。要求空间复杂度为 O(1)。简单题。
29-
- 这一题利用的算法是 Boyer-Moore Majority Vote Algorithm。https://www.zhihu.com/question/49973163/answer/235921864
29+
- 这一题利用的算法是 Boyer-Moore Majority Vote Algorithm。[https://www.zhihu.com/question/49973163/answer/235921864](https://www.zhihu.com/question/49973163/answer/235921864)

0 commit comments

Comments
 (0)
0