leetcode 643. Maximum Average Subarray I

最新推荐文章于 2021-02-04 18:09:46 发布

小雨润如酥

最新推荐文章于 2021-02-04 18:09:46 发布

阅读量195

点赞数

分类专栏： leetcode 文章标签： c语言 leetcode

本文链接：https://blog.csdn.net/zhaihaixu/article/details/76077010

版权

leetcode 专栏收录该内容

120 篇文章 1 订阅

订阅专栏

原题：

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].

代码如下：

double findMaxAverage(int* nums, int numsSize, int k) {
    int sum=0;
    for(int n=0;n<k;n++)
    {
        sum=sum+*(nums+n);
    }
    int max=sum;
    for(int n=0;n<numsSize-k;n++)
    {
        sum=sum-*(nums+n)+*(nums+n+k);
        if(sum>max)
            max=sum;
    }
    return (double)max/k;
}

依次遍历求最大值就好咯。