feat: add solutions to lc problem: No.0643. Maximum Average Subarray I

Author: yanglbme

solution/0600-0699/0643.Maximum Average Subarray I/README.md

@@ -32,7 +32,7 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
-滑动窗口
+滑动窗口。
 
 <!-- tabs:start -->
 
@@ -41,15 +41,35 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def findMaxAverage(self, nums: List[int], k: int) -> float:
+        s = sum(nums[:k])
+        ans = s
+        for i in range(k, len(nums)):
+            s += (nums[i] - nums[i - k])
+            ans = max(ans, s)
+        return ans / k
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public double findMaxAverage(int[] nums, int k) {
+        int s = 0;
+        for (int i = 0; i < k; ++i) {
+            s += nums[i];
+        }
+        int ans = s;
+        for (int i = k; i < nums.length; ++i) {
+            s += (nums[i] - nums[i - k]);
+            ans = Math.max(ans, s);
+        }
+        return ans * 1.0 / k;
+    }
+}
 ```
 
 ### **TypeScript**

solution/0600-0699/0643.Maximum Average Subarray I/README_EN.md

@@ -45,18 +45,40 @@
 
 ## Solutions
 
+Slide window.
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 ```python
-
+class Solution:
+    def findMaxAverage(self, nums: List[int], k: int) -> float:
+        s = sum(nums[:k])
+        ans = s
+        for i in range(k, len(nums)):
+            s += (nums[i] - nums[i - k])
+            ans = max(ans, s)
+        return ans / k
 ```
 
 ### **Java**
 
 ```java
-
+class Solution {
+    public double findMaxAverage(int[] nums, int k) {
+        int s = 0;
+        for (int i = 0; i < k; ++i) {
+            s += nums[i];
+        }
+        int ans = s;
+        for (int i = k; i < nums.length; ++i) {
+            s += (nums[i] - nums[i - k]);
+            ans = Math.max(ans, s);
+        }
+        return ans * 1.0 / k;
+    }
+}
 ```
 
 ### **TypeScript**

solution/0600-0699/0643.Maximum Average Subarray I/Solution.java

@@ -0,0 +1,14 @@
+class Solution {
+    public double findMaxAverage(int[] nums, int k) {
+        int s = 0;
+        for (int i = 0; i < k; ++i) {
+            s += nums[i];
+        }
+        int ans = s;
+        for (int i = k; i < nums.length; ++i) {
+            s += (nums[i] - nums[i - k]);
+            ans = Math.max(ans, s);
+        }
+        return ans * 1.0 / k;
+    }
+}

solution/0600-0699/0643.Maximum Average Subarray I/Solution.py

@@ -0,0 +1,8 @@
+class Solution:
+    def findMaxAverage(self, nums: List[int], k: int) -> float:
+        s = sum(nums[:k])
+        ans = s
+        for i in range(k, len(nums)):
+            s += (nums[i] - nums[i - k])
+            ans = max(ans, s)
+        return ans / k