643. Maximum Average Subarray I.go

package leetcode

funcfindMaxAverage(nums []int, kint) float64 {
sum:=0
for_, v:=rangenums[:k] {
sum+=v
 }
maxSum:=sum
fori:=k; i<len(nums); i++ {
sum=sum-nums[i-k] +nums[i]
maxSum=max(maxSum, sum)
 }
returnfloat64(maxSum) /float64(k)
}

funcmax(a, bint) int {
ifa>b {
returna
 }
returnb
}