-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSolution.java
More file actions
55 lines (49 loc) · 1.55 KB
/
Solution.java
File metadata and controls
55 lines (49 loc) · 1.55 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
import java.util.Arrays;
import java.util.ArrayList;
import java.util.Collections;
public class Solution {
static boolean[] visited;
static String route ="";
static ArrayList<String> list = new ArrayList<>();
public static void main(String[] args){
String[][] tickets = {
{"ICN", "JFK"},
{"HND", "IAD"},
{"JFK", "HND"}
};
String[] answer = solution(tickets);
System.out.println(Arrays.toString(answer));
}
public static String[] solution(String[][] tickets) {
for(int i=0; i<tickets.length; i++){
visited = new boolean[tickets.length];
String start = tickets[i][0];
String end = tickets[i][1];
if(start.equals("ICN")){
route = start + " ";
visited[i] = true;
dfs(tickets, end, 1);
}
}
Collections.sort(list);
String[] answer = list.get(0).split(" ");
return answer;
}
public static void dfs(String[][] tickets, String end, int cnt){
route += end + " ";
if(cnt == tickets.length){
list.add(route);
return;
}
for(int i=0; i<tickets.length; i++){
String s = tickets[i][0];
String e = tickets[i][1];
if(s.equals(end) && !visited[i]){
visited[i] = true;
dfs(tickets, e, cnt+1);
visited[i] = false;
route = route.substring(0, route.length()-4);
}
}
}
}