feat: add solutions to lc problem: No.1701. Average Waiting Time

Author: yanglbme

solution/1700-1799/1701.Average Waiting Time/README.md

@@ -54,27 +54,44 @@
 	<li><code>arrival<sub>i </sub><= arrival<sub>i+1</sub></code></li>
 </ul>
 
-
 ## 解法
 
 <!-- 这里可写通用的实现逻辑 -->
 
+记 totalWaitingTime 表示总等待时间，f 表示当次做菜完成时间。
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def averageWaitingTime(self, customers: List[List[int]]) -> float:
+        f = total_waiting_time = 0
+        for arrival, time in customers:
+            f = max(arrival, f) + time
+            total_waiting_time += (f - arrival)
+        return total_waiting_time / len(customers)
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public double averageWaitingTime(int[][] customers) {
+        int f = 0;
+        double totalWaitingTime = 0;
+        for (int[] customer : customers) {
+            f = Math.max(f, customer[0]) + customer[1];
+            totalWaitingTime += (f - customer[0]);
+        }
+        return totalWaitingTime / customers.length;
+    }
+}
 ```
 
 ### **...**

solution/1700-1799/1701.Average Waiting Time/README_EN.md

@@ -50,21 +50,36 @@ So the average waiting time = (2 + 6 + 4 + 1) / 4 = 3.25.
 	<li><code>arrival<sub>i&nbsp;</sub>&lt;= arrival<sub>i+1</sub></code></li>
 </ul>
 
-
 ## Solutions
 
 <!-- tabs:start -->
 
 ### **Python3**
 
 ```python
-
+class Solution:
+    def averageWaitingTime(self, customers: List[List[int]]) -> float:
+        f = total_waiting_time = 0
+        for arrival, time in customers:
+            f = max(arrival, f) + time
+            total_waiting_time += (f - arrival)
+        return total_waiting_time / len(customers)
 ```
 
 ### **Java**
 
 ```java
-
+class Solution {
+    public double averageWaitingTime(int[][] customers) {
+        int f = 0;
+        double totalWaitingTime = 0;
+        for (int[] customer : customers) {
+            f = Math.max(f, customer[0]) + customer[1];
+            totalWaitingTime += (f - customer[0]);
+        }
+        return totalWaitingTime / customers.length;
+    }
+}
 ```
 
 ### **...**

solution/1700-1799/1701.Average Waiting Time/Solution.java

@@ -0,0 +1,11 @@
+class Solution {
+    public double averageWaitingTime(int[][] customers) {
+        int f = 0;
+        double totalWaitingTime = 0;
+        for (int[] customer : customers) {
+            f = Math.max(f, customer[0]) + customer[1];
+            totalWaitingTime += (f - customer[0]);
+        }
+        return totalWaitingTime / customers.length;
+    }
+}

solution/1700-1799/1701.Average Waiting Time/Solution.py

@@ -0,0 +1,7 @@
+class Solution:
+    def averageWaitingTime(self, customers: List[List[int]]) -> float:
+        f = total_waiting_time = 0
+        for arrival, time in customers:
+            f = max(arrival, f) + time
+            total_waiting_time += (f - arrival)
+        return total_waiting_time / len(customers)