11package com .leetcode .google ;
22
3+ import java .util .ArrayList ;
4+ import java .util .Arrays ;
5+ import java .util .Collections ;
36import java .util .HashMap ;
7+ import java .util .LinkedList ;
48import java .util .List ;
9+ import java .util .Map ;
10+ import java .util .PriorityQueue ;
11+ import java .util .Stack ;
512import java .util .function .BiConsumer ;
613import java .util .function .Function ;
714
815/**
916 * Created by liwentian on 2017/9/2.
1017 */
11-
18+ /**
19+ * 这题有两个前提
20+ * 1, 必须从JFK开始
21+ * 2, 解一定存在
22+ */
23+ /**
24+ * 这题有两种解法:
25+ * 1, 常规是DFS暴力解法,面试能写出这种就行了
26+ * 2, 欧拉解法
27+ */
1228public class ReconstructItinerary {
1329
14- public List <String > findItinerary (String [][] tickets ) {
15- return null ;
30+ /**
31+ * 常规DFS暴力列出所有可能的路径,可以一次走遍所有的边
32+ */
33+ public List <List <String >> findItinerary (String [][] tickets ) {
34+ HashMap <String , ArrayList <String >> map = new HashMap <>();
35+ for (String [] ticket : tickets ) {
36+ map .computeIfAbsent (ticket [0 ], k -> new ArrayList <>()).add (ticket [1 ]);
37+ }
38+ List <List <String >> result = new LinkedList <>();
39+ dfs ("JFK" , result , map , new LinkedList <>(Arrays .asList ("JFK" )), tickets .length );
40+ return result ;
1641 }
1742
43+ void dfs (String airport , List <List <String >> result , HashMap <String , ArrayList <String >> map , LinkedList <String > route , int n ) {
44+ if (route .size () == n + 1 ) {
45+ result .add (new ArrayList <>(route ));
46+ return ;
47+ }
48+ if (!map .containsKey (airport ) || map .get (airport ).isEmpty ()) {
49+ return ;
50+ }
51+ ArrayList <String > list = map .get (airport );
52+ for (int i = 0 ; i < list .size (); i ++) {
53+ String target = list .remove (i );
54+
55+ route .add (target );
56+ dfs (target , result , map , route , n );
57+ route .removeLast ();
58+
59+ list .add (i , target );
60+ }
61+ }
62+
63+ /**
64+ * 题目要求是列出字母顺序最小的
65+ */
66+ public List <String > findItinerary2 (String [][] tickets ) {
67+ HashMap <String , ArrayList <String >> map = new HashMap <>();
68+ for (String [] ticket : tickets ) {
69+ map .computeIfAbsent (ticket [0 ], k -> new ArrayList <>()).add (ticket [1 ]);
70+ }
71+ for (List <String > list : map .values ()) {
72+ Collections .sort (list );
73+ }
74+ LinkedList <String > result = new LinkedList <>(Arrays .asList ("JFK" ));
75+ dfs ("JFK" , map , result , tickets .length );
76+ return result ;
77+ }
78+
79+ boolean dfs (String airport , HashMap <String , ArrayList <String >> map , LinkedList <String > route , int n ) {
80+ if (route .size () == n + 1 ) {
81+ return true ;
82+ }
83+ if (!map .containsKey (airport ) || map .get (airport ).isEmpty ()) {
84+ return false ;
85+ }
86+ ArrayList <String > list = map .get (airport );
87+ for (int i = 0 ; i < list .size (); i ++) {
88+ String target = list .remove (i );
89+
90+ route .add (target );
91+ if (dfs (target , map , route , n )) {
92+ return true ;
93+ }
94+ route .removeLast ();
95+
96+ list .add (i , target );
97+ }
98+ return false ;
99+ }
100+
101+ /**
102+ * 欧拉递归解法如下
103+ */
104+ public List <String > findItinerary3 (String [][] tickets ) {
105+ for (String [] ticket : tickets )
106+ targets .computeIfAbsent (ticket [0 ], k -> new PriorityQueue ()).add (ticket [1 ]);
107+ visit ("JFK" );
108+ return route ;
109+ }
110+
111+ Map <String , PriorityQueue <String >> targets = new HashMap <>();
112+ List <String > route = new LinkedList ();
113+
114+ void visit (String airport ) {
115+ while (targets .containsKey (airport ) && !targets .get (airport ).isEmpty ())
116+ visit (targets .get (airport ).poll ());
117+ route .add (0 , airport );
118+ }
119+
120+ /**
121+ * 欧拉迭代写法
122+ */
123+ public List <String > findItinerary4 (String [][] tickets ) {
124+ for (String [] ticket : tickets )
125+ targets .computeIfAbsent (ticket [0 ], k -> new PriorityQueue ()).add (ticket [1 ]);
126+
127+ Map <String , PriorityQueue <String >> targets = new HashMap <>();
128+ List <String > route = new LinkedList ();
129+
130+ Stack <String > stack = new Stack <>();
131+ stack .push ("JFK" );
132+
133+ while (!stack .isEmpty ()) {
134+ String s = stack .peek ();
135+ while (targets .containsKey (s ) && !targets .get (s ).isEmpty ())
136+ stack .push (targets .get (s ).poll ());
137+ route .add (0 , stack .pop ());
138+ }
139+
140+ return route ;
141+ }
18142}
0 commit comments