From d31333dddedac2eb255fe3fa97d36aeecda3d23e Mon Sep 17 00:00:00 2001
From: Cool <747682928@qq.com>
Date: Thu, 3 Oct 2024 17:21:55 +0800
Subject: [PATCH] =?UTF-8?q?2024/10/03=20=E7=81=B5=E7=A5=9E=E9=A2=98?=
 =?UTF-8?q?=E5=8D=95=20=E6=BB=91=E5=8A=A8=E7=AA=97=E5=8F=A3?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../sliding_windows/Num643.java               | 25 +++++++++++++++++++
 1 file changed, 25 insertions(+)
 create mode 100644 src/main/java/com/cool/ling_cha_mount/sliding_windows/Num643.java

diff --git a/src/main/java/com/cool/ling_cha_mount/sliding_windows/Num643.java b/src/main/java/com/cool/ling_cha_mount/sliding_windows/Num643.java
new file mode 100644
index 0000000..45b9fe9
--- /dev/null
+++ b/src/main/java/com/cool/ling_cha_mount/sliding_windows/Num643.java
@@ -0,0 +1,25 @@
+package com.cool.ling_cha_mount.sliding_windows;
+
+/**
+ * Created with IntelliJ IDEA.
+ *
+ * @Author: Cool
+ * @Date: 2024/10/03/17:14
+ * @Description:
+ */
+public class Num643 {
+
+    public double findMaxAverage(int[] nums, int k) {
+        int sum = 0;
+        for (int i = 0; i < k; i++) {
+            sum += nums[i];
+        }
+        int max = sum;
+        for (int i = k; i < nums.length; i++) {
+            sum += nums[i];
+            sum -= nums[i - k];
+            max = Math.max(max, sum);
+        }
+        return 1.0 * max / k;
+    }
+}