标签:tput div 均值 elements des 数组 desc int tco
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:
k
<= n
<= 30,000.
s
[LeetCode] Maximum Average Subarray I 子数组的最大平均值
标签:tput div 均值 elements des 数组 desc int tco
原文地址:http://www.cnblogs.com/grandyang/p/7294585.html