1396 Design Underground System - Medium
Problem:
An underground railway system is keeping track of customer travel times between different stations. They are using this data to calculate the average time it takes to travel from one station to another.
Implement the UndergroundSystem
class:
void checkIn(int id, string stationName, int t)
- A customer with a card ID equal to
id
, checks in at the stationstationName
at timet
. - A customer can only be checked into one place at a time.
- A customer with a card ID equal to
void checkOut(int id, string stationName, int t)
- A customer with a card ID equal to
id
, checks out from the stationstationName
at timet
.
- A customer with a card ID equal to
double getAverageTime(string startStation, string endStation)
- Returns the average time it takes to travel from
startStation
toendStation
. - The average time is computed from all the previous traveling times from
startStation
toendStation
that happened directly, meaning a check in atstartStation
followed by a check out fromendStation
. - The time it takes to travel from
startStation
toendStation
may be different from the time it takes to travel fromendStation
tostartStation
. - There will be at least one customer that has traveled from
startStation
toendStation
beforegetAverageTime
is called.
- Returns the average time it takes to travel from
You may assume all calls to the checkIn
and checkOut
methods are consistent. If a customer checks in at time t1
then checks out at time t2
, then t1 < t2
. All events happen in chronological order.
Example 1:
Input ["UndergroundSystem","checkIn","checkIn","checkIn","checkOut","checkOut","checkOut","getAverageTime","getAverageTime","checkIn","getAverageTime","checkOut","getAverageTime"] [[],[45,"Leyton",3],[32,"Paradise",8],[27,"Leyton",10],[45,"Waterloo",15],[27,"Waterloo",20],[32,"Cambridge",22],["Paradise","Cambridge"],["Leyton","Waterloo"],[10,"Leyton",24],["Leyton","Waterloo"],[10,"Waterloo",38],["Leyton","Waterloo"]]
Output [null,null,null,null,null,null,null,14.00000,11.00000,null,11.00000,null,12.00000]
Explanation UndergroundSystem undergroundSystem = new UndergroundSystem(); undergroundSystem.checkIn(45, "Leyton", 3); undergroundSystem.checkIn(32, "Paradise", 8); undergroundSystem.checkIn(27, "Leyton", 10); undergroundSystem.checkOut(45, "Waterloo", 15); // Customer 45 "Leyton" -> "Waterloo" in 15-3 = 12 undergroundSystem.checkOut(27, "Waterloo", 20); // Customer 27 "Leyton" -> "Waterloo" in 20-10 = 10 undergroundSystem.checkOut(32, "Cambridge", 22); // Customer 32 "Paradise" -> "Cambridge" in 22-8 = 14 undergroundSystem.getAverageTime("Paradise", "Cambridge"); // return 14.00000. One trip "Paradise" -> "Cambridge", (14) / 1 = 14 undergroundSystem.getAverageTime("Leyton", "Waterloo"); // return 11.00000. Two trips "Leyton" -> "Waterloo", (10 + 12) / 2 = 11 undergroundSystem.checkIn(10, "Leyton", 24); undergroundSystem.getAverageTime("Leyton", "Waterloo"); // return 11.00000 undergroundSystem.checkOut(10, "Waterloo", 38); // Customer 10 "Leyton" -> "Waterloo" in 38-24 = 14 undergroundSystem.getAverageTime("Leyton", "Waterloo"); // return 12.00000. Three trips "Leyton" -> "Waterloo", (10 + 12 + 14) / 3 = 12
Example 2:
Input ["UndergroundSystem","checkIn","checkOut","getAverageTime","checkIn","checkOut","getAverageTime","checkIn","checkOut","getAverageTime"] [[],[10,"Leyton",3],[10,"Paradise",8],["Leyton","Paradise"],[5,"Leyton",10],[5,"Paradise",16],["Leyton","Paradise"],[2,"Leyton",21],[2,"Paradise",30],["Leyton","Paradise"]]
Output [null,null,null,5.00000,null,null,5.50000,null,null,6.66667]
Explanation UndergroundSystem undergroundSystem = new UndergroundSystem(); undergroundSystem.checkIn(10, "Leyton", 3); undergroundSystem.checkOut(10, "Paradise", 8); // Customer 10 "Leyton" -> "Paradise" in 8-3 = 5 undergroundSystem.getAverageTime("Leyton", "Paradise"); // return 5.00000, (5) / 1 = 5 undergroundSystem.checkIn(5, "Leyton", 10); undergroundSystem.checkOut(5, "Paradise", 16); // Customer 5 "Leyton" -> "Paradise" in 16-10 = 6 undergroundSystem.getAverageTime("Leyton", "Paradise"); // return 5.50000, (5 + 6) / 2 = 5.5 undergroundSystem.checkIn(2, "Leyton", 21); undergroundSystem.checkOut(2, "Paradise", 30); // Customer 2 "Leyton" -> "Paradise" in 30-21 = 9 undergroundSystem.getAverageTime("Leyton", "Paradise"); // return 6.66667, (5 + 6 + 9) / 3 = 6.66667
Constraints:
1 <= id, t <= 106
1 <= stationName.length, startStation.length, endStation.length <= 10
- All strings consist of uppercase and lowercase English letters and digits.
- There will be at most
2 * 104
calls in total tocheckIn
,checkOut
, andgetAverageTime
. - Answers within
10-5
of the actual value will be accepted.
Problem Analysis:
-
Initialization:
- Two dictionaries are used for storing information:
checkInMap
: Maps customer ID to a tuple of (start station, check-in time).totalMap
: Maps route (start station, end station) to a list of total time and count.
- Two dictionaries are used for storing information:
-
Check-In:
- When a customer checks in, their ID is associated with a tuple containing the start station and check-in time in the
checkInMap
.
- When a customer checks in, their ID is associated with a tuple containing the start station and check-in time in the
-
Check-Out:
- When a customer checks out, the check-out station and time are used to calculate the total time spent on the route.
- The route information (start station, end station) is used to update the
totalMap
, adding the time spent and incrementing the count.
-
Average Time Retrieval:
- To get the average time for a given route, the
getAverageTime
function retrieves the total time and count fromtotalMap
and calculates the average.
- To get the average time for a given route, the
-
Time Complexity:
- Check-In: O(1)
- Check-Out: O(1)
- Get Average Time: O(1)
- All operations involve constant time lookups and updates in dictionaries.
-
Space Complexity:
- O(N + R), where N is the number of check-ins and R is the number of unique routes.
checkInMap
andtotalMap
grow with the number of check-ins and unique routes.- The storage requirements are directly proportional to the number of unique routes and the number of check-ins.
Solutions:
class UndergroundSystem:
def __init__(self):
self.checkInMap = {} # id -> (startStation, time)
self.totalMap = {} # (start, end) -> [totalTime, count]
def checkIn(self, id: int, stationName: str, t: int) -> None:
self.checkInMap[id] = (stationName, t)
def checkOut(self, id: int, stationName: str, t: int) -> None:
start, time = self.checkInMap[id]
route = (start, stationName)
if route not in self.totalMap:
self.totalMap[route] = [0,0]
self.totalMap[route][0] += t - time
self.totalMap[route][1] += 1
def getAverageTime(self, startStation: str, endStation: str) -> float:
total, count = self.totalMap[(startStation, endStation)]
return total/count