Leetcode/src/main/java/com/fishercoder/solutions/secondthousand/_1743.java at master · fishercoder1534/Leetcode · GitHub

Name: Leetcode/src/main/java/com/fishercoder/solutions/secondthousand/_1743.java at master · fishercoder1534/Leetcode · GitHub
Rating: 4.4 (6825 reviews)
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
packagecom.fishercoder.solutions.secondthousand;

importjava.util.ArrayList;
importjava.util.HashMap;
importjava.util.HashSet;
importjava.util.List;
importjava.util.Map;
importjava.util.Set;

publicclass_1743 {
publicstaticclassSolution1 {
publicint[] restoreArray(int[][] adjacentPairs) {
Map<Integer, Integer> map = newHashMap<>();
Map<Integer, List<Integer>> map2 = newHashMap<>();
for (int[] pair : adjacentPairs) {
intnum1 = pair[0];
intnum2 = pair[1];
map.put(num1, map.getOrDefault(num1, 0) + 1);
map.put(num2, map.getOrDefault(num2, 0) + 1);
if (!map2.containsKey(num1)) {
map2.put(num1, newArrayList<>());
 }
map2.get(num1).add(num2);
if (!map2.containsKey(num2)) {
map2.put(num2, newArrayList<>());
 }
map2.get(num2).add(num1);
 }
intfirst = Integer.MAX_VALUE;
for (intkey : map.keySet()) {
if (map.get(key) == 1) {
first = key;
break;
 }
 }
int[] original = newint[map.size()];
Set<Integer> set = newHashSet<>();
original[0] = first;
set.add(first);
for (inti = 1; i < map.size(); i++) {
intprev = original[i - 1];
List<Integer> connected = map2.get(prev);
for (intconn : connected) {
if (set.add(conn)) {
original[i] = conn;
break;
 }
 }
 }
returnoriginal;
 }
 }
}