Database System Concepts
Database System Concepts
7th Edition
ISBN: 9780078022159
Author: Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher: McGraw-Hill Education
Bartleby Related Questions Icon

Related questions

Question

Please answer the question in the screenshot. Please use the starter code. 

Practice 2
class GraphApp {
public List<String>
Given a list of airline tickets represented
by pairs of departure and arrival airports
findItinerary(String[][] tickets) {
[from, to], reconstruct the itinerary in
// your code goes here
order. All of the tickets belong to a man
}
who departs from JFK. Thus, the itinerary
}
must begin with JFK.
Note:
Example 1:
If there are multiple valid itineraries,
you should return the itinerary that
tickets = [["MUC", "LHR"], ["JFK", "MUC"], ["SFO", "SJC"], ["LHR", "SFO"]]
has the smallest lexical order when
Return ["JFK", "MUC", "LHR", "SFO", "SJC"].
read as a single string. For example,
Example 2:
the itinerary ["JFK", "LGA"] has a
smaller lexical order than ["JFK",
tickets =
"LGB"].
[["JFK","SFO"],["JFK","ATL"],["SFO","ATL"],["ATL","JFK"],["ATL","SFO")]
All airports are represented by three
Return ["JFK","ATL","JFK","SFO","ATL","SFO"].
capital letters (IATA code).
Another possible reconstruction is ["JFK","SFO","ATL","JFK","ATL","SFO"]
You may assume all tickets form at
least one valid itinerary.
expand button
Transcribed Image Text:Practice 2 class GraphApp { public List<String> Given a list of airline tickets represented by pairs of departure and arrival airports findItinerary(String[][] tickets) { [from, to], reconstruct the itinerary in // your code goes here order. All of the tickets belong to a man } who departs from JFK. Thus, the itinerary } must begin with JFK. Note: Example 1: If there are multiple valid itineraries, you should return the itinerary that tickets = [["MUC", "LHR"], ["JFK", "MUC"], ["SFO", "SJC"], ["LHR", "SFO"]] has the smallest lexical order when Return ["JFK", "MUC", "LHR", "SFO", "SJC"]. read as a single string. For example, Example 2: the itinerary ["JFK", "LGA"] has a smaller lexical order than ["JFK", tickets = "LGB"]. [["JFK","SFO"],["JFK","ATL"],["SFO","ATL"],["ATL","JFK"],["ATL","SFO")] All airports are represented by three Return ["JFK","ATL","JFK","SFO","ATL","SFO"]. capital letters (IATA code). Another possible reconstruction is ["JFK","SFO","ATL","JFK","ATL","SFO"] You may assume all tickets form at least one valid itinerary.
Expert Solution
Check Mark
Knowledge Booster
Background pattern image
Computer Science
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Text book image
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Text book image
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Text book image
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
Text book image
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Text book image
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education