LeetCode973_最接近原点的 K 个点_排序_堆排序_经典堆排序写法

驹子还是叶子

已于 2022-08-26 23:38:36 修改

阅读量118

点赞数

分类专栏： LeetCode 文章标签：算法 leetcode 排序算法数据结构

于 2022-08-26 23:37:12 首次发布

本文链接：https://blog.csdn.net/qq_40992456/article/details/126551904

版权

LeetCode 专栏收录该内容

19 篇文章 0 订阅

订阅专栏

解题思路

比优先队列快,可能是最快的堆排序,16ms

代码

class Solution {
    public int[][] kClosest(int[][] points, int k) {
        int[][] result = new int[k][2];
        buildMinHeap(points);
        int len = points.length;
        for (int i = points.length - 1; i > points.length - k - 1; i--) {
            swap(points, 0, i);
            len--;
            heapAdjust(points, 0, len);
        }
        System.arraycopy(points, points.length - k, result, 0, k);
        return result;
    }

    private void buildMinHeap(int[][] heap) {
        int len = heap.length;
        for (int i = len / 2 - 1; i >= 0; i--) {
            heapAdjust(heap, i, len);
        }
    }

    private void heapAdjust(int[][] heap, int root, int heapLen) {
        int[] temp = heap[root];
        for (int i = (root << 1) + 1; i < heapLen; i = (i << 1) + 1) {
            if (i < heapLen - 1 && distance(heap[i + 1][0], heap[i + 1][1]) < distance(heap[i][0], heap[i][1])) {
                i++;
            }
            if (distance(temp[0], temp[1]) <= distance(heap[i][0], heap[i][1])) {
                break;
            }
            heap[root] = heap[i];
            root = i;
        }
        heap[root] = temp;
    }

    private int distance(int x, int y) {
        return x * x + y * y;
    }

    private void swap(int[][] heap, int a, int b) {
        int[] temp = heap[a];
        heap[a] = heap[b];
        heap[b] = temp;
    }
}