字母结点型DSU

字母节点型DSU:
在这里插入图片描述

Solution:

Use a hashmap to store a mapping between the labels of nodes and the labels of their parent nodes. For each item in this hashmap, the key is the label of one node and the value is the label of its parent node.

Code:

import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;

public class DSU {
    private Map<String, String> parent;
    private Map<String, Integer> rank;

    public DSU(String[][] edges) {
        parent = new HashMap<>();
        rank = new HashMap<>();

        for(String[] edge: edges) {
            for(String node: edge) {
                if (!parent.containsKey(node)) {
                    parent.put(node, node);
                    rank.put(node, 0);
                }
            }
        }
    }

    public String find(String s) {
        if(!s.equals(parent.get(s))) {
            String root = find(parent.get(s));
            parent.put(s, root);
        }
        return parent.get(s);
    }

    public void union(String s1, String s2) {
        String s1R = find(s1);
        String s2R = find(s2);

        if(s1R.equals(s2R)) {
            return;
        }else{
            if(rank.get(s1R) < rank.get(s2R)) {
                parent.put(s1R, s2R);
            }if(rank.get(s1R) > rank.get(s2R)) {
                parent.put(s2R, s1R);
            }else{
                parent.put(s2R, s1R);
                rank.put(s1R, rank.get(s1R)+1);
            }
        }
    }

    public int getConnectedPart() {
        int connectedPart = 0;
        for(String key: parent.keySet()) {
            if(parent.get(key).equals(key)) {
                connectedPart += 1;
            }
        }
        return connectedPart;
    }

    public static void main(String[] args) {
        String[][] edges = {{"A", "B"}, {"A", "C"}, {"B", "C"}, {"D", "E"}};
        DSU dsu = new DSU(edges);

        for(String[] edge: edges) {
            dsu.union(edge[0], edge[1]);
        }

        int connectedPart = dsu.getConnectedPart();
        System.out.println(connectedPart); // 2
    }

}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值