https://h30306.github.io/blog/tags/heap-priority-queue/Recent content in Heap-Priority-Queue onHugo -- gohugo.ioenhwork0511@gmail.com (Wei Yi Chung)hwork0511@gmail.com (Wei Yi Chung)© 2026 Wei Yi ChungTue, 22 Nov 2022 00:00:00 +0000https://h30306.github.io/blog/leetcode/leetcode-2099/Tue, 22 Nov 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-2099/LeetCode 2099 note: pick the k largest values along with their indices, then sort by index to restore the original orderhttps://h30306.github.io/blog/leetcode/leetcode-2231/Tue, 22 Nov 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-2231/LeetCode 2231 note: odd digits swap only with odd digits and even with even; sort each group and refill each position with the largest digit of its parityhttps://h30306.github.io/blog/leetcode/leetcode-2335/Tue, 22 Nov 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-2335/LeetCode 2335 note: the answer is max(the largest count, ceil(total / 2)); simulating means filling one cup from each of the two largest every secondhttps://h30306.github.io/blog/leetcode/leetcode-1337/Mon, 21 Nov 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-1337/LeetCode 1337 note: soldiers come first in each row, so binary search the first 0 for the count; sort by (count, row index) and take khttps://h30306.github.io/blog/leetcode/leetcode-1464/Mon, 21 Nov 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-1464/LeetCode 1464 note: all values are positive, so take the two largest a and b and return (a - 1)(b - 1)https://h30306.github.io/blog/leetcode/leetcode-264/Mon, 14 Nov 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-264/LeetCode 264 note: three pointers mark the next ugly numbers to multiply by 2, 3 and 5; take the minimum each time and advance every pointer that produced ithttps://h30306.github.io/blog/leetcode/leetcode-215/Sat, 29 Oct 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-215/LeetCode 215 note: keep a min-heap of size k whose top is the k-th largest, or use quickselect for O(n) on averagehttps://h30306.github.io/blog/leetcode/leetcode-1046/Fri, 30 Sep 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-1046/LeetCode 1046 note: from a max-heap (negated values) take the two heaviest each round, push back their difference if unequal, and return the last stone or 0https://h30306.github.io/blog/leetcode/leetcode-703/Wed, 31 Aug 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-703/LeetCode 703 note: keep a min-heap of size k; its top is the k-th largesthttps://h30306.github.io/blog/leetcode/leetcode-506/Thu, 25 Aug 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-506/LeetCode 506 note: sort indices by score descending, give medals to the top three and rank strings to the rest, writing back into the original positions