24 lines
440 B
Go
24 lines
440 B
Go
// Package q643 implements a solution for https://leetcode.com/problems/maximum-average-subarray-i/
|
|
package q643
|
|
|
|
import "math"
|
|
|
|
func findMaxAverage(nums []int, k int) float64 {
|
|
var maxSum = math.MinInt
|
|
|
|
sum := 0
|
|
for i := range nums {
|
|
if i < k-1 {
|
|
sum += nums[i]
|
|
} else {
|
|
sum += nums[i]
|
|
if i >= k {
|
|
sum -= nums[i-k]
|
|
}
|
|
maxSum = max(maxSum, sum)
|
|
}
|
|
}
|
|
return float64(maxSum) / float64(k)
|
|
}
|
|
|
|
var _ = findMaxAverage
|