leetCode刷题记录73_643_Maximum Average Subarray I

/*****************************************************问题描述*************************************************
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 <= k <= n <= 30,000.
Elements of the given array will be in the range [-10,000, 10,000].
给定一个整数数组，确定一个子数组的长度，返回子数组平均值的最大值
/*****************************************************我的解答*************************************************
/**
 * @param {number[]} nums
 * @param {number} k
 * @return {number}
 */
var findMaxAverage = function(nums, k) {
    var aveOfArr = function(numbers,k){
        var sum = 0;
        for(var index = 0; index < k; index++)
        {
            sum += numbers[index];
        }
        return sum / k;
    }
    var retHighest = -Infinity;
    for(var index = 0; index < nums.length; index++)
    {
        if(aveOfArr(nums.slice(index,index + k),k) > retHighest)
        {
            retHighest = aveOfArr(nums.slice(index,index + k),k);
        }    
    }
    return retHighest;
};
console.log(findMaxAverage([1,12,-5,-6,50,3],4));