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

同步日记

Browse Source
This commit is contained in:
zzz
2025-03-18 17:44:46 +08:00
parent 8e9e13563d
commit d6ef4c901d
24 changed files with 892 additions and 119 deletions
Download Patch File Download Diff File Expand all files Collapse all files

7
算法/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）算法