Update 紀錄/40 2022 0308 Heap 3nd.md

Co-authored-by: Louis <louis222220@gmail.com>

Author: the-yuyut

紀錄/40 2022 0308 Heap 3nd.md

@@ -27,3 +27,12 @@
 * 	🔓	MEDIUM	1167	Minimum Cost to Connect Sticks	https://leetcode.com/problems/minimum-cost-to-connect-sticks
 * 	MEDIUM	1642	Furthest Building You Can Reach	https://leetcode.com/problems/furthest-building-you-can-reach
 * 	HARD	295	Find Median from Data Stream	https://leetcode.com/problems/find-median-from-data-stream
+
+---
+
+- 從 Array 建立起 Heap 的時間複雜度
+	- Foreach => O(N LogN)
+	- Heapify => O(N)
+- No. 347. Top K Frequent Elements 解法
+	- 算出每個數字的頻率後，把頻率表放進 heap
+	- 使用 Bucket Sort