Merge pull request #35 from programmingbookclub/42-2022-0503-heap-5th

Create 42 2022 0503 heap 5th.md

Author: the-yuyut

紀錄/42 2022 0503 heap 5th.md

@@ -0,0 +1,68 @@
+# LeetCode 讀書會第 42 次聚會 2022/05/03
+
+## leetcode 讀書會通知
+
+1. 項目: 第 42 次聚會
+2. 目的: 線上一起寫題目, 由有想法的人帶領, 先解題, 再看該題有趣的解法
+3. 時間: 05/03 (二) 20:00 ~ 21:00
+4. 地點: google meet 線上 (前 10 分鐘預備鏈接)
+5. 解題項目:  [Heap](https://leetcode.com/explore/featured/card/heap/643/heap/)
+6. 共筆: GitHub https://github.com/programmingbookclub/Leetcode-club
+7. 備註: 這次會看 378, 是一題 MEDIUM 的題目
+
+
+
+--- 
+
+* 	[done] MEDIUM	215	Kth Largest Element in an Array	https://leetcode.com/problems/kth-largest-element-in-an-array
+* 	[done] MEDIUM	347	Top K Frequent Elements	https://leetcode.com/problems/top-k-frequent-elements
+* 	[done] EASY	703	Kth Largest Element in a Stream	https://leetcode.com/problems/kth-largest-element-in-a-stream
+* 	[done] EASY	1046	Last Stone Weight	https://leetcode.com/problems/last-stone-weight
+* 	[done] EASY	1337	The K Weakest Rows in a Matrix	https://leetcode.com/problems/the-k-weakest-rows-in-a-matrix
+* 	MEDIUM	378	Kth Smallest Element in a Sorted Matrix	https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix
+* 	🔓	MEDIUM	253	Meeting Rooms II	https://leetcode.com/problems/meeting-rooms-ii
+* 	MEDIUM	973	K Closest Points to Origin	https://leetcode.com/problems/k-closest-points-to-origin
+* 	🔓	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
+
+---
+
+
+Y.J. LEE下午8:02
+Helli
+Hello XD
+Y.J. LEE下午8:30
+Tip: time/space analysis 可以把avg case / best case / worst case分開討論
+Y.J. LEE下午8:54
+10個剛好可以
+8就有可能出現在mat[1][-1] 最後一個
+Y.J. LEE下午8:55
+great test case
+Louis Su下午8:56
+🙏
+Y.J. LEE下午9:05
+很優啊 實戰給出binary search應該就是optimal solution了
+Y.J. LEE下午9:09
+👍
+Y.J. LEE下午9:11
+yes, #1631 can use heap
+Lester下午9:13
+有事先走唷，謝謝大家。
+Y.J. LEE下午9:13
+881
+Y.J. LEE下午9:15
+剛那題時間複雜度比較複雜
+每一行還可以再binary search一次
+我當時是寫  time O(nlogn * log(S)), where S=span of min to max
+但是也不確定對不對
+Y.J. LEE下午9:18
+嗯 前面 nlogn就是 猜了那個數以後 數一數看看比他小的有幾個
+Louis Su下午9:18
+https://github.com/louis222220/leetcode-practice/pull/2/files
+Y.J. LEE下午9:24
+nice implementation
+看了一下 Java 的實作
+他是用 generic iterator
+Y.J. LEE下午9:26
+https://hg.openjdk.java.net/jdk8/jdk8/jdk/file/687fd7c7986d/src/share/classes/java/util/PriorityQueue.java