最大子数组平均值
题目描述:
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].
思路就非常简单了:遍历数组,依次求出第i个元素到第i+k个元素的和,找出其中的最大值,最后除以k得到均值
public double findMaxAverage(int[] nums, int k) {
int temp=0;
for(int i=0;i<k;i++){
temp+=nums[i];
}
int sum=temp;
for(int i=1;i<=nums.length-k;i++){
if(sum<(temp-nums[i-1]+nums[i+k-1])){
sum=temp-nums[i-1]+nums[i+k-1];
}
temp=temp-nums[i-1]+nums[i+k-1];
}
return (double)sum/k;
}