We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 55315c6 commit b9c3497Copy full SHA for b9c3497
src/main/java/com/fishercoder/solutions/_332.java
@@ -12,12 +12,12 @@ public static class Solution1 {
12
/**
13
* credit: https://discuss.leetcode.com/topic/36383/share-my-solution
14
*/
15
- public List<String> findItinerary(String[][] tickets) {
+ public List<String> findItinerary(List<List<String>> tickets) {
16
Map<String, PriorityQueue<String>> flights = new HashMap<>();
17
LinkedList<String> path = new LinkedList<>();
18
- for (String[] ticket : tickets) {
19
- flights.putIfAbsent(ticket[0], new PriorityQueue<>());
20
- flights.get(ticket[0]).add(ticket[1]);
+ for (List<String> ticket : tickets) {
+ flights.putIfAbsent(ticket.get(0), new PriorityQueue<>());
+ flights.get(ticket.get(0)).add(ticket.get(1));
21
}
22
dfs("JFK", flights, path);
23
return path;
0 commit comments