Golang Leetcode 643. Maximum Average Subarray I.go

func findMaxAverage(nums []int, k int) float64 {
	sum := 0
	for i := 0; i < k; i++ {
		sum += nums[i]
	}
	m := sum
	for i := k; i < len(nums); i++ {
		sum = sum - nums[i-k] + nums[i]
		if sum > m {
			m = sum
		}
	}
	return float64(m) / float64(k)
}
```
更多内容请移步我的repo：https://github.com/anakin/golang-leetcode