forked from ex01tus/leetcode-grind
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathReconstructItinerary.java
More file actions
66 lines (51 loc) · 2.04 KB
/
ReconstructItinerary.java
File metadata and controls
66 lines (51 loc) · 2.04 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
63
64
65
66
package graph;
import java.util.*;
/**
* Description: https://leetcode.com/problems/reconstruct-itinerary
* Difficulty: Hard
* Time complexity: O(V ^ E)
* Space complexity: O(V + E)
*/
public class ReconstructItinerary {
private static final String START = "JFK";
public List<String> findItinerary(List<List<String>> tickets) {
Map<String, List<Ticket>> adjList = buildAdjList(tickets);
List<String> itinerary = new ArrayList<>();
itinerary.add(START);
int[] usedTickets = new int[tickets.size()];
return findItinerary(START, adjList, usedTickets, itinerary);
}
private List<String> findItinerary(
String current,
Map<String, List<Ticket>> adjList,
int[] usedTickets,
List<String> currentItinerary) {
if (currentItinerary.size() == usedTickets.length + 1) {
return currentItinerary;
}
for (Ticket next : adjList.getOrDefault(current, List.of())) {
if (usedTickets[next.index] == 0) {
usedTickets[next.index] = 1;
currentItinerary.add(next.destination);
List<String> itinerary = findItinerary(next.destination, adjList, usedTickets, currentItinerary);
if (!itinerary.isEmpty()) return itinerary;
usedTickets[next.index] = 0;
currentItinerary.remove(currentItinerary.size() - 1);
}
}
return List.of();
}
private Map<String, List<Ticket>> buildAdjList(List<List<String>> tickets) {
Map<String, List<Ticket>> adjList = new HashMap<>();
for (int i = 0; i < tickets.size(); i++) {
List<String> ticket = tickets.get(i);
adjList.computeIfAbsent(ticket.get(0), __ -> new ArrayList<>()).add(new Ticket(ticket.get(1), i));
}
for (List<Ticket> t : adjList.values()) {
t.sort(Comparator.comparing(a -> a.destination));
}
return adjList;
}
private record Ticket(String destination, int index) {
}
}