Zane/obsidian-notes
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

biji

Browse Source
This commit is contained in:
zzz
2025-06-11 18:37:23 +08:00
parent b844ebb3e5
commit b8b4cf5cf8
299 changed files with 564 additions and 112 deletions
Download Patch File Download Diff File Expand all files Collapse all files

7
InBox/算法/TopK 问题.md Normal file
View File

@@ -0,0 +1,7 @@
地址：[前端进阶算法10：别再说你不懂topk问题了 · Issue #73 · sisterAn/JavaScript-Algorithms (github.com)](https://github.com/sisterAn/JavaScript-Algorithms/issues/73)
解法：
1、最小最大堆
2、快速选择(快速排序+快速选择时基准恰好等于K时)
3、中位数的中位数（BFPRT）算法