Repository navigation
Expand file tree
/
Copy path0721. Accounts Merge.java
More file actions
62 lines (47 loc) · 2.1 KB
/
Copy path0721. Accounts Merge.java
File metadata and controls
62 lines (47 loc) · 2.1 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
class Solution {
HashSet<String> visited = new HashSet<>();
Map<String, List<String>> adjacent = new HashMap<String, List<String>>();
private void DFS(List<String> mergedAccount, String email) {
visited.add(email);
mergedAccount.add(email);
if (!adjacent.containsKey(email)) {
return;
}
for (String neighbor : adjacent.get(email)) {
if (!visited.contains(neighbor)) {
DFS(mergedAccount, neighbor);
}
}
}
public List<List<String>> accountsMerge(List<List<String>> accountList) {
int accountListSize = accountList.size();
for (List<String> account : accountList) {
int accountSize = account.size();
String accountFirstEmail = account.get(1);
for (int j = 2; j < accountSize; j++) {
String accountEmail = account.get(j);
if (!adjacent.containsKey(accountFirstEmail)) {
adjacent.put(accountFirstEmail, new ArrayList<String>());
}
adjacent.get(accountFirstEmail).add(accountEmail);
if (!adjacent.containsKey(accountEmail)) {
adjacent.put(accountEmail, new ArrayList<String>());
}
adjacent.get(accountEmail).add(accountFirstEmail);
}
}
List<List<String>> mergedAccounts = new ArrayList<>();
for (List<String> account : accountList) {
String accountName = account.get(0);
String accountFirstEmail = account.get(1);
if (!visited.contains(accountFirstEmail)) {
List<String> mergedAccount = new ArrayList<>();
mergedAccount.add(accountName);
DFS(mergedAccount, accountFirstEmail);
Collections.sort(mergedAccount.subList(1, mergedAccount.size()));
mergedAccounts.add(mergedAccount);
}
}
return mergedAccounts;
}
}