LeetCode刷题记179-1584. 连接所有点的最小费用

LeetCode刷题记179

1584. 连接所有点的最小费用

题目

class Solution {
    public int minCostConnectPoints(int[][] points) {
        int ans = 0;
        int[] d = new int[points.length];
        boolean[] v = new boolean[points.length];
        Arrays.fill(d, Integer.MAX_VALUE);
        int minD, minId = 0;
        int pre = 0;
        v[0] = true;
        int n = points.length;
        while (--n > 0) {
            minD = Integer.MAX_VALUE;
            minId = 0;
            for (int i = 0; i < points.length; i ++) {
                if (v[i]) continue;
                int tmp = Math.abs(points[i][0] - points[pre][0]) + Math.abs(points[i][1] - points[pre][1]);
                d[i] = Math.min(d[i], tmp);
                if (d[i] < minD) {
                    minId = i;
                    minD = d[i];
                }
            }
            ans += minD;
            v[minId] = true;
            pre = minId;
        }
        return ans;
    }
}

最小生成树–克鲁斯卡尔