mfocko/LeetCode
mfocko/LeetCode
1
0
Fork 0
Code Issues Pull requests Wiki Activity

java: add «643. Maximum Average Subarray I»

Browse source 
Signed-off-by: Matej Focko <me@mfocko.xyz>
This commit is contained in:
Matej Focko 2024-08-12 16:56:12 +02:00
parent 8c0c14f406
commit 4b297be824
Signed by: mfocko
SSH key fingerprint: SHA256:icm0fIOSJUpy5+1x23sfr+hLtF9UhY8VpMC7H4WFJP8
1 changed files with 21 additions and 0 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

21
java/maximum-average-subarray-i.java Normal file
View file

@ -0,0 +1,21 @@
class Solution {
private long sumFirst(int[] nums, int k) {
long sum = 0;
for (var i = 0; i < k; ++i) {
sum += nums[i];
}
return sum;
}
public double findMaxAverage(int[] nums, int k) {
var runningSum = sumFirst(nums, k);
var foundMax = runningSum;
for (var i = k; i < nums.length; ++i) {
runningSum += nums[i] - nums[i - k];
foundMax = Math.max(foundMax, runningSum);
}
return (double) foundMax / k;
}
}