有些名字有多种拼法,例如,John 和 Jon 本质上是相同的名字,但被当成了两个名字公布出来。给定两个列表,一个是名字及对应的频率,另一个是本质相同的名字对。设计一个算法打印出每个真实名字的实际频率。注意,如果 John 和 Jon 是相同的,并且 Jon 和 Johnny 相同,则 John 与 Johnny 也相同,即它们有传递和对称性。
在结果列表中,选择字典序最小的名字作为真实名字。
示例:
输入:names = ["John(15)","Jon(12)","Chris(13)","Kris(4)","Christopher(19)"], synonyms = ["(Jon,John)","(John,Johnny)","(Chris,Kris)","(Chris,Christopher)"]
输出:["John(27)","Chris(36)"]
并查集
package com.loo;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
public class NameMerge {
private static int[] parents = null;
private static Map<String , Integer> name_id = new HashMap<String , Integer>();
private static Map<Integer , String> id_name = new HashMap<Integer , String>();
private static Map<String , Integer> frequence = new HashMap<String , Integer>();
public static void main(String[] args) {
String[] names = {"John(15)","Jon(12)","Chris(13)","Kris(4)","Christopher(19)"};
String[] synonyms = {"(Jon,John)","(John,Johnny)","(Chris,Kris)","(Chris,Christopher)"};
System.out.println(Arrays.toString(getNameMerge(names , synonyms)));
}
public static String[] getNameMerge(String[] names , String[] synonyms) {
int N = names.length;
parents = new int[N];
for (int i=0;i<N;i++) {
parents[i] = i;
int idx = names[i].indexOf("(");
String name = names[i].substring(0, idx);
String freq = names[i].substring(idx + 1, names[i].length() - 1);
name_id.put(name, i);
id_name.put(i, name);
frequence.put(name, Integer.parseInt(freq));
}
for (String synonym : synonyms) {
String[] p = synonym.substring(1, synonym.length()-1).split(",");
String nameA = p[0];
String nameB = p[1];
Integer idA = name_id.get(nameA);
Integer idB = name_id.get(nameB);
if (idA == null || idB == null) {
continue;
}
union(idA , idB);
}
List<String> result = new ArrayList<String>();
frequence.forEach((name , freq)->{
result.add(name + "(" + freq + ")");
});
return result.stream().toArray(String[]::new);
}
public static int find(int x) {
if (parents[x] == x) {
return x;
}
parents[x]= find(parents[x]);
return parents[x];
}
public static void union(int a , int b) {
if (a == b) {
return;
}
int pa = find(a);
int pb = find(b);
if (pa == pb) {
return;
}
String nameA = id_name.get(pa);
String nameB = id_name.get(pb);
if (nameA.compareTo(nameB)<0) {
frequence.put(nameA, frequence.get(nameA)+frequence.get(nameB));
parents[pb] = pa;
frequence.remove(nameB);
} else {
frequence.put(nameB, frequence.get(nameA)+frequence.get(nameB));
parents[pa] = pb;
frequence.remove(nameA);
}
}
}