华为OD-最富裕的小家庭

涉及技术

并查集

import java.util.HashMap;
import java.util.Map;

public class WealthiestFamily {

    public static int maxMoney(int n, int[] money, int[][] relation) {
        UnionFind uf = new UnionFind(n);

        // 构建并查集
        for (int[] rel : relation) {
            uf.union(rel[0], rel[1]);
        }

        // 计算每个连通分量的总财富
        Map<Integer, Integer> wealthMap = new HashMap<>();
        for (int i = 0; i < n; i++) {
            int root = uf.find(i);
            wealthMap.put(root, wealthMap.getOrDefault(root, 0) + money[i]);
        }

        // 找到最大财富
        return wealthMap.values().stream().max(Integer::compareTo).orElse(0);
    }

    static class UnionFind {
        int[] parent;
        int[] rank;

        public UnionFind(int n) {
            parent = new int[n];
            rank = new int[n];
            for (int i = 0; i < n; i++) {
                parent[i] = i;
                rank[i] = 1;
            }
        }

        public int find(int x) {
            if (parent[x] != x) {
                parent[x] = find(parent[x]); // 路径压缩
            }
            return parent[x];
        }

        public void union(int x, int y) {
            int rootX = find(x);
            int rootY = find(y);
            if (rootX != rootY) {
                if (rank[rootX] > rank[rootY]) {
                    parent[rootY] = rootX;
                } else if (rank[rootX] < rank[rootY]) {
                    parent[rootX] = rootY;
                } else {
                    parent[rootY] = rootX;
                    rank[rootX]++;
                }
            }
        }
    }

    public static void main(String[] args) {
        int n = 5;
        int[] money = {10, 20, 30, 40, 50};
        int[][] relation = {{0, 1}, {2, 3}, {3, 4}};
        System.out.println(maxMoney(n, money, relation)); // 输出应为 120
    }
}