Given an array consisting of n integers, find the contiguous subarray of given length k that has the maximum average value. And you need to output the maximum average value.

Example 1:

Input: [1,12,-5,-6,50,3], k = 4 Output: 12.75 Explanation: Maximum average is (12-5-6+50)/4 = 51/4 = 12.75 

Note:

1. 1 <= k <= n <= 30,000.
2. Elements of the given array will be in the range [-10,000, 10,000].

给定 n 个整数，找出平均数最大且长度为 k 的连续子数组，并输出该最大平均数。

• 简单题。循环一次，扫描数组过程中累加窗口大小为 k 的元素值。不断更新这个最大值。循环结束求出平均值即可。

package leetcode funcfindMaxAverage(nums []int, kint) float64 { sum:=0for_, v:=rangenums[:k] { sum+=v } maxSum:=sumfori:=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 }