最小堆求topk问题

最小堆求topk问题

	public static void main(String[] args) {
        int[] nums = new int[]{5, 3, 2, 10, 8, 1, 4, 9, 3, 12};
        topk(nums, 9);
    }

    public static int[] topk(int[] nums, int k) {
        int[] minHeap = new int[k];
        for (int i = 0; i < nums.length; i++) {
            if (i < k) {
                minHeap[i] = nums[i];
                int index = i;
                while (index > 0) {
                    if (minHeap[index] < minHeap[(index - 1) / 2]) {
                        swap(minHeap, index, (index - 1) / 2);
                    }
                    index = (index - 1) / 2;
                }
            } else {
                if (nums[i] > minHeap[0]) {
                    minHeap[0] = nums[i];
                    for (int index = 0; index * 2 + 1 < k; ) {
                        int minIndex = (index * 2 + 2 < k && minHeap[index * 2 + 1] > minHeap[index * 2 + 2]) ? index * 2 + 2 : index * 2 + 1;
                        if (minHeap[index] > minHeap[minIndex]) {
                            swap(minHeap, index, minIndex);
                            index = minIndex;
                        } else break;
                    }
                }
            }
        }
        return minHeap;
    }

    public static void swap(int[] nums, int i, int j) {
        int temp = nums[i];
        nums[i] = nums[j];
        nums[j] = temp;
    }