add 1701

Author: fishercoder1534

paginated_contents/algorithms/2nd_thousand/README.md

@@ -122,6 +122,7 @@
 | 1708 | [Largest Subarray Length K](https://leetcode.com/problems/largest-subarray-length-k/)                                                                                                         | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/secondthousand/_1708.java)                                          || Easy                                                | Array, Greedy                    |
 | 1705 | [Maximum Number of Eaten Apples](https://leetcode.com/problems/maximum-number-of-eaten-apples/)                                                                                               | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/secondthousand/_1705.java)                                          || Medium                                              | Heap, Greedy                     |
 | 1704 | [Determine if String Halves Are Alike](https://leetcode.com/problems/determine-if-string-halves-are-alike/)                                                                                   | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/secondthousand/_1704.java)                                          || Easy                                                | String                           |
+| 1701 | [Average Waiting Time](https://leetcode.com/problems/average-waiting-time/)                                                                               | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/secondthousand/_1701.java)                                          || Medium                                              | Array                            |
 | 1700 | [Number of Students Unable to Eat Lunch](https://leetcode.com/problems/number-of-students-unable-to-eat-lunch/)                                                                               | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/secondthousand/_1700.java)                                          || Easy                                                | Array                            |
 | 1695 | [Maximum Erasure Value](https://leetcode.com/problems/maximum-erasure-value/)                                                                                                                 | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/secondthousand/_1695.java)                                          || Medium                                              | Two Pointers                     |
 | 1694 | [Reformat Phone Number](https://leetcode.com/problems/reformat-phone-number/)                                                                                                                 | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/secondthousand/_1694.java)                                          || Easy                                                | String                           |

src/main/java/com/fishercoder/solutions/secondthousand/_1701.java

@@ -0,0 +1,23 @@
+package com.fishercoder.solutions.secondthousand;
+
+public class _1701 {
+    public static class Solution1 {
+        /**
+         * A simple one-pass, just simulate what the problem describes.
+         */
+        public double averageWaitingTime(int[][] customers) {
+            long totalWaitTime = customers[0][1];
+            int chefFinishTime = customers[0][0] + customers[0][1];
+            for (int i = 1; i < customers.length; i++) {
+                int arrival = customers[i][0];
+                int prep = customers[i][1];
+                if (chefFinishTime < arrival) {
+                    chefFinishTime = arrival;
+                }
+                chefFinishTime += prep;
+                totalWaitTime += chefFinishTime - arrival;
+            }
+            return (double) totalWaitTime / customers.length;
+        }
+    }
+}

src/test/java/com/fishercoder/secondthousand/_1701Test.java

@@ -0,0 +1,31 @@
+package com.fishercoder.secondthousand;
+
+import com.fishercoder.solutions.secondthousand._1701;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+
+import static junit.framework.TestCase.assertEquals;
+
+public class _1701Test {
+    private static _1701.Solution1 solution1;
+    private static int[] A;
+
+    @BeforeEach
+    public void setup() {
+        solution1 = new _1701.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(5.0, solution1.averageWaitingTime(new int[][]{
+                {1, 2}, {2, 5}, {4, 3}
+        }));
+    }
+
+    @Test
+    public void test2() {
+        assertEquals(3.25, solution1.averageWaitingTime(new int[][]{
+                {5, 2}, {5, 4}, {10, 3}, {20, 1}
+        }));
+    }
+}