Heap-Priority-Queue onhttps://h30306.github.io/blog/zh-tw/tags/heap-priority-queue/Recent content in Heap-Priority-Queue onHugo -- gohugo.iozh-twhwork0511@gmail.com (Wei Yi Chung)hwork0511@gmail.com (Wei Yi Chung)© 2026 Wei Yi ChungTue, 22 Nov 2022 00:00:00 +0000LeetCode 2099: Find Subsequence of Length K With the Largest Sumhttps://h30306.github.io/blog/zh-tw/leetcode/leetcode-2099/Tue, 22 Nov 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/zh-tw/leetcode/leetcode-2099/LeetCode 2099 解題筆記：選出最大的 k 個數（連同 index），再按 index 排回原本的順序LeetCode 2231: Largest Number After Digit Swaps by Parityhttps://h30306.github.io/blog/zh-tw/leetcode/leetcode-2231/Tue, 22 Nov 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/zh-tw/leetcode/leetcode-2231/LeetCode 2231 解題筆記：奇數位數只能跟奇數交換、偶數只能跟偶數交換；分別排序後，依原本每個位置的奇偶放回最大的LeetCode 2335: Minimum Amount of Time to Fill Cupshttps://h30306.github.io/blog/zh-tw/leetcode/leetcode-2335/Tue, 22 Nov 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/zh-tw/leetcode/leetcode-2335/LeetCode 2335 解題筆記：答案是 max(最多的那種, ceil(總數 / 2))；模擬的話每秒從最多的兩種各裝一杯LeetCode 1337: The K Weakest Rows in a Matrixhttps://h30306.github.io/blog/zh-tw/leetcode/leetcode-1337/Mon, 21 Nov 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/zh-tw/leetcode/leetcode-1337/LeetCode 1337 解題筆記：每列的士兵都在前面，用二分找第一個 0 就是士兵數；照（士兵數, 列號）排序取前 k 個LeetCode 1464: Maximum Product of Two Elements in an Arrayhttps://h30306.github.io/blog/zh-tw/leetcode/leetcode-1464/Mon, 21 Nov 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/zh-tw/leetcode/leetcode-1464/LeetCode 1464 解題筆記：值都是正數，取最大的兩個數 a、b，答案是 (a - 1)(b - 1)LeetCode 264: Ugly Number IIhttps://h30306.github.io/blog/zh-tw/leetcode/leetcode-264/Mon, 14 Nov 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/zh-tw/leetcode/leetcode-264/LeetCode 264 解題筆記：三個指針分別指向下一個要乘 2、3、5 的醜數，每次取最小的，相等的指針都要前進LeetCode 215: Kth Largest Element in an Arrayhttps://h30306.github.io/blog/zh-tw/leetcode/leetcode-215/Sat, 29 Oct 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/zh-tw/leetcode/leetcode-215/LeetCode 215 解題筆記：維持大小為 k 的 min-heap，堆頂就是第 k 大；或用 quickselect 平均 O(n)LeetCode 1046: Last Stone Weighthttps://h30306.github.io/blog/zh-tw/leetcode/leetcode-1046/Fri, 30 Sep 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/zh-tw/leetcode/leetcode-1046/LeetCode 1046 解題筆記：max-heap（存負數）每次拿出最重的兩顆，不一樣重就把差放回去，最後剩一顆或沒有LeetCode 703: Kth Largest Element in a Streamhttps://h30306.github.io/blog/zh-tw/leetcode/leetcode-703/Wed, 31 Aug 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/zh-tw/leetcode/leetcode-703/LeetCode 703 解題筆記：維持一個大小為 k 的最小堆，堆頂就是第 k 大LeetCode 506: Relative Rankshttps://h30306.github.io/blog/zh-tw/leetcode/leetcode-506/Thu, 25 Aug 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/zh-tw/leetcode/leetcode-506/LeetCode 506 解題筆記：把 index 按分數由高到低排序，前三名給獎牌，其他給名次的字串，放回原本的位置