_1701.java

packagecom.fishercoder.solutions.secondthousand;

publicclass_1701 {
publicstaticclassSolution1 {
/*
 * A simple one-pass, just simulate what the problem describes.
 */
publicdoubleaverageWaitingTime(int[][] customers) {
longtotalWaitTime = customers[0][1];
intchefFinishTime = customers[0][0] + customers[0][1];
for (inti = 1; i < customers.length; i++) {
intarrival = customers[i][0];
intprep = customers[i][1];
if (chefFinishTime < arrival) {
chefFinishTime = arrival;
 }
chefFinishTime += prep;
totalWaitTime += chefFinishTime - arrival;
 }
return (double) totalWaitTime / customers.length;
 }
 }
}