From dd8a44a86775a76d36170234aa62e00fcec0f7b2 Mon Sep 17 00:00:00 2001
From: BangDori <qudwns8865@naver.com>
Date: Thu, 26 Dec 2024 22:20:07 +0900
Subject: [PATCH] [Leetcode - Easy] Maximum Average Subarray I

---
 bangdori/Maximum Average Subarray I.js | 27 ++++++++++++++++++++++++++
 1 file changed, 27 insertions(+)
 create mode 100644 bangdori/Maximum Average Subarray I.js

diff --git a/bangdori/Maximum Average Subarray I.js b/bangdori/Maximum Average Subarray I.js
new file mode 100644
index 0000000..1be11e1
--- /dev/null
+++ b/bangdori/Maximum Average Subarray I.js	
@@ -0,0 +1,27 @@
+/**
+ * @param {number[]} nums
+ * @param {number} k
+ * @return {number}
+ */
+var findMaxAverage = function (nums, k) {
+  let maxSubSum = -Infinity;
+  let currSum = 0;
+  let lptr = 0,
+    rptr = 0;
+
+  for (let i = 0; i < nums.length; i += 1) {
+    rptr += 1;
+
+    if (rptr - lptr > k) {
+      currSum -= nums[lptr];
+      lptr += 1;
+    }
+
+    currSum += nums[i];
+    if (rptr - lptr === k) {
+      maxSubSum = Math.max(maxSubSum, currSum);
+    }
+  }
+
+  return maxSubSum / k;
+};