package com.daily.daily20210204;
/**
* @Project: dailyCode
* @Site: http://www.zhao1iang.club/
* @Copyright: ©CodeLamp
* @Author: zhaoliang
* @Create: 2021-02-04 14:13
* @Desc: 子数组最大平均数I
**/
public class findMaxAverage {
//给定 n 个整数,找出平均数最大且长度为 k 的连续子数组,并输出该最大平均数。
public double findMaxAverage(int[] nums,int k){
int sum = 0;
for (int i = 0; i <k ; i++) {
sum+=nums[i];
}
int maxSum = sum;
for (int i = k; i <nums.length ; i++) {
sum = sum - nums[i - k] + nums[i];
maxSum = Math.max(sum,maxSum);
}
return 1.0*maxSum/k;
}
}
日常刷题-子数组最大平均数I
最新推荐文章于 2024-09-25 10:36:42 发布