Welcome to Subscribe On Youtube
1701. Average Waiting Time
Description
There is a restaurant with a single chef. You are given an array customers
, where customers[i] = [arrival_{i}, time_{i}]:
arrival_{i}
is the arrival time of thei^{th}
customer. The arrival times are sorted in nondecreasing order.time_{i}
is the time needed to prepare the order of thei^{th}
customer.
When a customer arrives, he gives the chef his order, and the chef starts preparing it once he is idle. The customer waits till the chef finishes preparing his order. The chef does not prepare food for more than one customer at a time. The chef prepares food for customers in the order they were given in the input.
Return the average waiting time of all customers. Solutions within 10^{5}
from the actual answer are considered accepted.
Example 1:
Input: customers = [[1,2],[2,5],[4,3]] Output: 5.00000 Explanation: 1) The first customer arrives at time 1, the chef takes his order and starts preparing it immediately at time 1, and finishes at time 3, so the waiting time of the first customer is 3  1 = 2. 2) The second customer arrives at time 2, the chef takes his order and starts preparing it at time 3, and finishes at time 8, so the waiting time of the second customer is 8  2 = 6. 3) The third customer arrives at time 4, the chef takes his order and starts preparing it at time 8, and finishes at time 11, so the waiting time of the third customer is 11  4 = 7. So the average waiting time = (2 + 6 + 7) / 3 = 5.
Example 2:
Input: customers = [[5,2],[5,4],[10,3],[20,1]] Output: 3.25000 Explanation: 1) The first customer arrives at time 5, the chef takes his order and starts preparing it immediately at time 5, and finishes at time 7, so the waiting time of the first customer is 7  5 = 2. 2) The second customer arrives at time 5, the chef takes his order and starts preparing it at time 7, and finishes at time 11, so the waiting time of the second customer is 11  5 = 6. 3) The third customer arrives at time 10, the chef takes his order and starts preparing it at time 11, and finishes at time 14, so the waiting time of the third customer is 14  10 = 4. 4) The fourth customer arrives at time 20, the chef takes his order and starts preparing it immediately at time 20, and finishes at time 21, so the waiting time of the fourth customer is 21  20 = 1. So the average waiting time = (2 + 6 + 4 + 1) / 4 = 3.25.
Constraints:
1 <= customers.length <= 10^{5}
1 <= arrival_{i}, time_{i} <= 10^{4}
arrival_{i }<= arrival_{i+1}
Solutions
Solution 1: Simulation
We use a variable tot
to record the total waiting time of the customers, and a variable t
to record the time when each customer’s order is completed. The initial values of both are $0$.
We traverse the customer array customers
. For each customer:
If the current time t
is less than or equal to the customer’s arrival time customers[i][0]
, it means that the chef is not cooking, so the chef can start cooking immediately. The time to complete this dish is $t = customers[i][0] + customers[i][1]$, and the customer’s waiting time is customers[i][1]
.
Otherwise, it means that the chef is cooking, so the customer needs to wait for the chef to finish the previous dishes before starting to cook their own dishes. The time to complete this dish is $t = t + customers[i][1]$, and the customer’s waiting time is $t  customers[i][0]$.
The time complexity is $O(n)$, where $n$ is the length of the customer array customers
. The space complexity is $O(1)$.

class Solution { public double averageWaitingTime(int[][] customers) { double tot = 0; int t = 0; for (var e : customers) { int a = e[0], b = e[1]; t = Math.max(t, a) + b; tot += t  a; } return tot / customers.length; } }

class Solution { public: double averageWaitingTime(vector<vector<int>>& customers) { double tot = 0; int t = 0; for (auto& e : customers) { int a = e[0], b = e[1]; t = max(t, a) + b; tot += t  a; } return tot / customers.size(); } };

class Solution: def averageWaitingTime(self, customers: List[List[int]]) > float: tot = t = 0 for a, b in customers: t = max(t, a) + b tot += t  a return tot / len(customers)

func averageWaitingTime(customers [][]int) float64 { tot, t := 0, 0 for _, e := range customers { a, b := e[0], e[1] t = max(t, a) + b tot += t  a } return float64(tot) / float64(len(customers)) }

function averageWaitingTime(customers: number[][]): number { let [tot, t] = [0, 0]; for (const [a, b] of customers) { t = Math.max(t, a) + b; tot += t  a; } return tot / customers.length; }

function averageWaitingTime(customers) { let [tot, t] = [0, 0]; for (const [a, b] of customers) { t = Math.max(t, a) + b; tot += t  a; } return tot / customers.length; }

impl Solution { pub fn average_waiting_time(customers: Vec<Vec<i32>>) > f64 { let mut tot = 0.0; let mut t = 0; for e in customers.iter() { let a = e[0]; let b = e[1]; t = t.max(a) + b; tot += (t  a) as f64; } tot / customers.len() as f64 } }