maximum average subarray

最新推荐文章于 2021-02-05 14:02:20 发布

凝视深空

最新推荐文章于 2021-02-05 14:02:20 发布

阅读量1.1k

点赞数

分类专栏：算法

本文链接：https://blog.csdn.net/coder_lj/article/details/64438621

版权

算法专栏收录该内容

5 篇文章 0 订阅

订阅专栏

Given an array with positive and negative numbers, find the maximum average subarray which length should be greater or 
equal to given length k.

Example

Given nums = [1, 12, -5, -6, 50, 3], k = 3

Return 15.667 // (-6 + 50 + 3) / 3 = 15.667

void maxAverage(int nums[],int k,int n) { float max,c_max,t_max; for(int i=0;i<=n-k;i++) { for(int j=i;j<i+k;j++) { c_max+=nums[j]; } if(i==0) max=t_max=c_max; t_max=c_max; if(t_max>max) { max=t_max; } c_max=0; } float average=max/k; printf("maxaverage of subarray is %.5f\n",average); } void main() { int n; printf("enter size:\n"); scanf("%d",&n); int *arr=malloc(n*sizeof(int)); printf("enter elems:\n"); for(int i=0;i<n;i++) scanf("%d",&arr[i]); int k; printf("enter k:\n"); scanf("%d",&k); maxAverage(arr,k,n); }