力扣每日一题2022-09-28中等题：第K个数

---

题目描述

第k个数

---

思路

最小堆

根据题意，其实就是计算1、3、5、7以及他们的倍数的从小到大排序的第k个数。
可以使用最小堆实现。初始时，堆为空，首先将最小的数1加入堆。每次取出堆顶元素x，则x是堆中最小的数，由于3x、5x、7x也是符合要求的数，因此将3x、5x、7x加入堆。由于这个过程中会出现重复元素，所以可以使用集合去重，避免相同元素多次加入堆。在排除重复元素的情况下，第k次从最小堆中取出的数就是第k个数。

Python实现

class Solution:
    def getKthMagicNumber(self, k: int) -> int:
        factors = [3, 5, 7]
        seen = {1}
        heap = [1]
        for i in range(k-1):
            cur = heapq.heappop(heap)
            for factor in factors:
                if (nxt := cur * factor) not in seen:
                    seen.add(nxt)
                    heapq.heappush(heap, nxt)
        return heapq.heappop(heap)

Java实现

class Solution {
    public int getKthMagicNumber(int k) {
        int[] factors = {3, 5, 7};
        Set<Long> seen = new HashSet<>();
        PriorityQueue<Long> heap = new PriorityQueue<>();
        seen.add(1L);
        heap.offer(1L);
        int magic = 0;
        for (int i = 0; i < k; i++) {
            long cur = heap.poll();
            magic = (int) cur;
            for (int factor : factors) {
                long nxt = cur * factor;
                if (seen.add(nxt)) {
                    heap.offer(nxt);
                }
            }
        }
        return magic;
    }
}

C++实现

class Solution {
public:
    int getKthMagicNumber(int k) {
        vector<int> factors = {3, 5, 7};
        unordered_set<long> seen;
        priority_queue<long, vector<long>, greater<long>> heap;
        seen.insert(1L);
        heap.push(1L);
        int magic = 0;
        for (int i = 0; i < k; i++) {
            long cur = heap.top();
            heap.pop();
            magic = (int) cur;
            for (int factor : factors) {
                long nxt = cur * factor;
                if (!seen.count(nxt)) {
                    seen.insert(nxt);
                    heap.push(nxt);
                }
            }
        }
        return magic;
    }
};